LintCode_044_最小子数组

问题描述

样例

求解

class Solution {
public:
int minSubArray(vector<int> &nums) {
int minSum = 0;
int curSum = 0;
for (auto it = nums.begin(); it != nums.end(); ++it)
{
if (it == nums.begin())
{
minSum = *it;
}
curSum += *it;
if (curSum < minSum)
{
minSum = curSum;
}
if (curSum > 0)
{
curSum = 0;
}
}
return minSum;
}
};