【LeetCode】解题53：Maximum Subarray

Problem 53: Maximum Subarray [Easy]

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.

来源：LeetCode

解题思路

基本思想：贪心算法。总是作出使和最大的选择。
变量：1. 当前最大和 2. 全局最大和

具体算法：

• sum代表当前最大和，max代表全局最大和。
• 遍历数组，sum对当前元素nums[i]进行累加，与max作比较并更新max，当sum < 0时，说明当前的累计和对后续无正贡献，则将sum清零。

时间复杂度：O($n$)

题中建议的分治法类似于合并排序，时间复杂度：O($n\log n$)

Solution (Java)

class Solution {
    public int maxSubArray(int[] nums) {
        int N = nums.length;
        if(N == 1) return nums[0];
        int max = Integer.MIN_VALUE;
        int sum = 0;
        for(int i = 0; i < N; i++){
            sum += nums[i];
            if(sum > max){
                max = sum;
            }
            if(sum < 0){
                sum = 0;
            }
        }
        return max;
    }
}