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

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

}

};