Lesson02\FrogRiverOne::solution()

Complexity

Conditions	2
Paths	2

Size

Total Lines	11
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($X, $A)
    {
        $minimumTime = -1;
        $uniques = array_unique($A);
        if (count($uniques) >= $X) {
            $allKeys = array_keys($uniques);
            $minimumTime = max($allKeys);
        }

        return $minimumTime;
    }
}