leetcode 53. Maximum Subarray

题意

题解

代码

class Solution {
public:
int maxSubArray(vector<int>& nums) {
int len = nums.size();
int temp = 0;
vector<int> dp(nums);
int maxsum = -1000000;
for(int i = 1; i < len; i++)
{
dp[i] = max(dp[i-1] + dp[i], dp[i]);
if(dp[i] > maxsum)
maxsum = dp[i];
}
return max(dp[0], maxsum);
}
};