Lesson04\Triangle::solution()

Complexity

Conditions	5
Paths	3

Size

Total Lines	15
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($A)
    {
        $count = count($A);
        sort($A);
        for ($i = 0; $i < $count - 2; $i++) {
            $p = $A[$i];
            $q = $A[$i + 1];
            $r = $A[$i + 2];
            if ($p + $q > $r && $q + $r > $p && $r + $p > $q) {
                return 1;
            }
        }

        return 0;
    }
}