原题目:
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 max = nums[0], sum = nums[0];
for(int i=1; i<nums.size(); i++)
{
if(nums[i] < 0 && sum > max) max = sum;
if(sum < 0) sum = nums[i];
else sum += nums[i];
}
return sum > max ? sum : max;
}
};