Lintcode：最小子数组

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

样例

给出数组[1, -1, -2, 1]，返回 -3

python：

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

C++：

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