题解 | #连续子数组的最大和#

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
        int ans=array[0];
        for(int i=1;i<array.size();i++){
            array[i]=max(array[i],array[i-1]+array[i]);
            ans=max(ans,array[i]);
        }
        return ans;
    }
};