Leetcode 53 - Maximum Subarray

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

For example, given the array [−2,1,−3,4,−1,2,1,−5,4],

the contiguous subarray [4,−1,2,1] has the largest sum = 6.

思路：设opt[i]代表以nums[i]结尾的subarray的最优解。

则opt[i+1] = max(opt[i]+nums[i+1],nums[i+1])。

class Solution {
public:
int maxSubArray(vector<int>& nums) {
int result = INT_MIN;
int temp = 0;
for(int i=0;i<nums.size();i++){
//递推条件
temp = max(temp+nums[i],nums[i]);
result = max(result,temp);
}
return result;
}
};