leetcode Maximum Subarray 加最大的子序串

最新推荐文章于 2021-09-01 09:36:25 发布

MHSLZ1

最新推荐文章于 2021-09-01 09:36:25 发布

阅读量124

点赞数

分类专栏： PHP 文章标签： php leetcode

本文链接：https://blog.csdn.net/u010785091/article/details/97394597

版权

PHP 专栏收录该内容

61 篇文章 0 订阅

订阅专栏

Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

Example:

Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.

Follow up:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

   function maxSubArray($nums) {
        
        
        $max = $nums[0];
        $dp_n = $nums[0];
        for($i=1; $i<count($nums); $i++){
            $dp_n = $nums[$i] + ($dp_n>0 ? $dp_n : 0);
            $max = $dp_n>$max ? $dp_n : $max;
        }
        return $max;
    }