连续子数组的最大和

动态规划

class Solution {
public:
    int FindGreatestSumOfSubArray(vector<int> array) {
        int max_sum = INT_MIN;
        int sum = 0;
        for(int i = 0; i < array.size(); ++i)
        {
            if(sum >= 0)
                sum = sum + array[i];
            else
                sum = array[i];
            max_sum = (sum > max_sum ? sum : max_sum);
        }
        return max_sum;
    }
};