Maximum Subarray

Maximum Subarray
Difficulty: Medium
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.

click to show more practice.

Hide Tags Divide and Conquer Array Dynamic Programming
Hide Similar Problems (M) Best Time to Buy and Sell Stock (M) Maximum Product Subarray

最直接的思路（O（n^2））：

   int maxSubArray(vector<int>& nums) {        int len=nums.size(),sum,max=0;        for(int i=0;i<len;i++){            sum = 0;            for(int j=i;j<len;j++){                sum += nums[j];                if(sum > max)                    max=sum;            }        }        return max;    }

分析（O(n)），动态规划思想：

    int maxSubArray(vector<int>& nums) {        int len=nums.size(),sum=0,max=nums[0];        for(int i=0;i<len;i++){            sum = sum>0?sum+nums[i]:nums[i];            if(sum > max)                max=sum;        }        return max;    }