[LeetCode] 53.Maximum Subarray

 

＂踏上LeetCode解題之路，順手紀錄一下PHP練功的過程囉。這是第六篇~~＂

Maximum Subarray - LeetCode

思考過程

待補上

結果✅

class Solution {

    /**
     * @param Integer[] $nums
     * @return Integer
     */

    function maxSubArray($nums) {
        $max = $nums[0];
        $cur = $nums[0];
        foreach($nums as $k => $v){
            if ($k > 0){
                $cur = max($v,$cur+$v);
            }
            $max = max($max,$cur);
        }
        return $max;
    }

        
}