Leetcode--Java--53. Maximum Subarray

题目描述

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

样例描述

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
 

Constraints:

1 <= nums.length <= 3 * 104
-105 <= nums[i] <= 105
 

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.

思路

1. 动态规划思想，维护一个临时数组和s，遍历数组里的每个x，若临时和小于0，说明不能要当前元素x，重新开始计算子数组，大于0直接相加即可

代码

class Solution {
    public int maxSubArray(int[] nums) {
        int s = 0, res = -999999;
        for (int x: nums){
            if (s <= 0) s = x;
            else s += x;
            res = Math.max(res, s);
        }
        return res;
    }
}