题目:
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
.
Subscribe to see which companies asked this question.
于是就很简单了:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = nums[0], tsum = nums[0];
for(int i = 1; i < nums.size(); ++i){
if(tsum >= 0){
tsum += nums[i];
}
else{
tsum = nums[i];
}
if(sum < tsum){
sum = tsum;
}
}
return sum;
}
};