题解 | #矩阵中的路径#

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