LeetCode 53. Maximum Subarray

LeetCode 53. Maximum Subarray

题目来源：https://leetcode.com/problems/maximum-subarray/description/

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.

public int maxSubArray(int[] nums) {
        int len=nums.length;
        if(nums==null||len==0)
            return 0;
        int sum=nums[0];
        int max=nums[0];
        for(int i=1;i<len;i++){
            if(sum<0){
                sum=nums[i];
            }
            else{
                sum=sum+nums[i];        //可以写成sum=nums[i]+(sum<0?0:sum)
            }
            max=Math.max(max,sum);  
        }
        return max;
   动态规划问题：首先需要总结出子问题，需要求数组num[0,i]的连续的最大和，如果sum(0,i-1)不小于0，sum(0,i)=sum(0,i-1)+nums[i];
   状态方程为：sum(0,i) = a[i] + (sum(0,i-1) < 0 ? 0 : sum(0,i-1))