44. 最小子数组

 1 int minSubArray(vector<int> &nums) {
 2     // write your code here
 3         int sum = nums[0];
 4         int min_sum = nums[0];
 5         for (int i = 1; i<nums.size(); i++) {
 6             sum = min(nums[i], nums[i] + nums[i - 1]);
 7             if (min_sum>sum)
 8             {
 9                 min_sum = sum;
10             }
11             nums[i] = sum;
12         }
13         return min_sum;
14     }