lintcode-44-最小子数组

44-最小子数组

code

class Solution {
public:
/**
* @param nums: a list of integers
* @return: A integer denote the sum of minimum subarray
*/
int minSubArray(vector<int> nums) {
// write your code here
int size=nums.size(), i=0, dec=0, minValue=nums[0];

dec = nums[0];
for(i=1; i<size; i++) {
if(dec > 0) {
dec = nums[i];
}
else {
dec += nums[i];
}
if(dec < minValue) {
minValue = dec;
}
}
return minValue;
}
};