剑指offer 连续子数组的最大和

 1 class Solution {
 2 public:
 3     int FindGreatestSumOfSubArray(vector<int> array) {
 4         int len = array.size();
 5         vector<int> ans(array);
 6         int res = ans[0];
 7         for (int i = 1; i < len; i++) {
 8             ans[i] = max(array[i], array[i] + ans[i - 1]);
 9             res = max(res, ans[i]);
10         }
11         return res;
12     }
13 };