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

1.int max ;int min

#include<limits.h>

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