Lesson01\PermMissingElem::solution()

Complexity

Conditions	4
Paths	6

Size

Total Lines	17
Code Lines	11

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($A)
    {
        $missing = 1;
        $count = count($A);
        sort($A);
        for ($i = 0; $i < $count; $i++) {
            if ($A[$i] != $i + 1) {
                $missing = $i + 1;
                break;
            }
        }
        if ($i == $count) {
            $missing = $count + 1;
        }

        return $missing;
    }
}