在线处理算法

 1 class Solution {
 2 public:
 3     /**
 4      * @param nums: a list of integers
 5      * @return: A integer denote the sum of minimum subarray
 6      */
 7     int minSubArray(vector<int> nums) {
 8         // write your code here
 9         if (nums.size() == 1) {
10             return nums[0];
11         } else {
12             int res = nums[0];  int sum = 0;
13             for (int pos = 0; pos < nums.size(); pos++) {
14                 if (sum >= 0) {
15                     sum = nums[pos];
16                 } else {
17                     sum += nums[pos];
18                 }
19                 if (sum < res) {
20                     res = sum;
21                 }
22             }
23             return res;
24         }
25     }
26 };