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 len = nums.size();
int temp = nums[0];
int sum = 0;
for(int i=0; i < len; i++)
{
sum = sum + nums[i];
temp = max(sum , temp); //记录最大子序列(可以确定右终点)
sum = max(sum , 0); //相当于改变最大子序列的起点(可以确定左起点)
}
return temp;
}
};