Lesson07\MaxProfit::solution()

Complexity

Conditions	5
Paths	2

Size

Total Lines	19
Code Lines	11

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($A)
    {
        $N = count($A);
        $maxProfit = 0;
        if ($N) {
            $minPrice = $A[0];
            for ($i = 1; $i < $N; $i++) {
                if ($A[$i] < $minPrice) {
                    $minPrice = $A[$i];
                }

                if ($A[$i] - $minPrice > $maxProfit) {
                    $maxProfit = $A[$i] - $minPrice;
                }
            }
        }

        return $maxProfit;
    }
}