[leetcode] Maximum Subarray

From : https://leetcode.com/problems/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

.

class Solution {
public:
int maxSubArray(vector<int>& nums) {
int ans = nums[nums.size()-1], pre=ans;
for(int i=nums.size()-2; i>=0; i--) {
pre = nums[i] + (pre>0)*pre;
if(pre > ans) ans=pre;
}
return ans;
}
};