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
.
一、问题描述:输入一个整数数组,求数组中连续的子数组使其和最大。
二、解题方法:
//从左至右扫描数组,如果前面一段连续子数组的和小于0,则置为0,重新从下个元素开始累加
int maxSubArray(vector<int>& nums)
{
int ans=nums[0];//注意:ans应该初始化为数组第一个元素
int curSum=0;
int n=nums.size();
for(int i=0;i<n;i++)
{
curSum+=nums[i];
if(curSum>ans)
ans=curSum;
if(curSum<0)
curSum=0;
}
return ans;
}