面试题31 连续子数组的最大和

 1 class Solution {
 2 public:
 3     vector<int> v;
 4     int FindGreatestSumOfSubArray(vector<int> array) {
 5         if (array.size() <= 0)
 6             return 0;
 7         v.push_back(array[0]);
 8         int max = v[0];
 9         for (int i = 1; i < array.size(); i++){
10             if (v[i - 1] <= 0)
11                 v.push_back(array[i]);
12             else
13                 v.push_back(array[i] + v[i - 1]);
14             if (v[i] > max)
15                 max = v[i];
16         }
17         return max;
18     }
19 };