LeetCode 刷题记录 53. Maximum Subarray

题目：
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:

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.
解法1：
动态规划（参考LeetCode题解，151道题完整版）

c++：

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        
        int res = INT_MIN;
        
        int curSum = 0;
        for(int i = 0; i < nums.size(); i++){
            if(curSum <= 0){
                curSum = nums[i];
            } else {
                curSum = curSum + nums[i];
            }
            res = max(res,curSum);
        }
        return res;
        
    }
};

java：

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

python：

class Solution(object):
    def maxSubArray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        res = -sys.maxint - 1
        
        curSum = 0
        for num in nums:
            if curSum <= 0:
                curSum = num
            else:
                curSum = curSum + num
            
            res = max(res,curSum)
        
        return res;