Lintcode：最大子数组

给定一个整数数组，找到一个具有最大和的子数组，返回其最大和。

样例

给出数组[−2,2,−3,4,−1,2,1,−5,3]，符合要求的子数组为[4,−1,2,1]，其最大和为6

python：

class Solution:
    """
    @param: nums: A list of integers
    @return: A integer indicate the sum of max subarray
    """
    def maxSubArray(self, nums):
        # write your code here
        n = len(nums)
        maxSum = sum(nums)
        curSum = 0
        for i in range(n):
            curSum += nums[i]
            if curSum > maxSum:
                maxSum = curSum
            if curSum < 0:
                curSum = 0
        return maxSum

C++：

class Solution {
public:
    /*
     * @param nums: A list of integers
     * @return: A integer indicate the sum of max subarray
     */
    int maxSubArray(vector<int> &nums) {
        // write your code here
        if (nums.size() == 1)
            return nums[0];
        int n = nums.size();
        int maxSum = 0;
        for (int i = 0; i < n; i++)
        {
            maxSum += nums[i];
        }
        int curSum = 0;
        
        for (int j = 0; j < n; j++)
        {
            curSum += nums[j];
            if (curSum > maxSum)
                maxSum = curSum;
            if (curSum < 0)
                curSum = 0;
        }
        return maxSum;
        
    }
};