LeetCode刷题之53 Maximum Subarray

1.Description

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

2.Test Cases

Example 1:

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

Example 2:

Input: nums = [1]
Output: 1

Example 3:

Input: nums = [5,4,-1,7,8]
Output: 23

3.Solution

3.1

既然是求最长子串的和的值最大，那就累计的结果sum，当累加完下一个数字nums[i]后，如果nums[i]的值为正数，那么最大子串和肯定就是sum，但是如果nums[i]的值为负数，那么sum的结果就变小了，但是若sum>0，那么它依旧可能是最大值。如果sum<0, 那再去累加后面的num[i],也只是在减小sum值，因此应当放弃这部分的值，重新赋值sum=0。

class Solution {
    public int maxSubArray(int[] nums) {
        int sum =0;
        int max = nums[0];
        for (int i = 0; i < nums.length; i++) {
            sum += nums[i];
            max = Math.max(max, sum);
            if (sum < 0)
                sum = 0;
        }
        return max;
    }
}