Sword To Offer 030 - 连续子数组的最大和

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
        int res = INT_MIN;
        int sum = 0;
        for(auto number : array) {
            sum += number;
            res = max(res, sum);
            if(sum < 0) {
                sum = 0;
            }
        }
        return res;
    }
};