学习目标: BM72 连续子数组的最大和 题目内容: 具体步骤: 分析 class Solution { public: int FindGreatestSumOfSubArray(vector<int> array) { vector<int> dp(array.size(), 0); dp[0] = array[0]; int m = dp[0]; for (int i = 1; i < array.size(); i++) { dp[i] = max(dp[i-1]+array[i], array[i]); m = max(m, dp[i]); } return m; } };