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
.
More practice:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
当curSum<0的时候重新计算curSum,因为任何一个数加上一个数都会变小。
class Solution {
public:
int maxSubArray(vector<int>& nums) {
if(nums.empty())
return 0;
int maxSum = nums[0];
int temp = 0;
for (int i = 0; i < nums.size(); i++){
if (temp<0){
temp = nums[i];
}
else
temp = temp + nums[i];
if (temp>maxSum)
maxSum = temp;
}
return maxSum;
}
};