Problem:
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 n=nums.size();
int sum=0;
int maxsum=nums[0];
for(int i=0;i<n;i++)
{
if(sum>0)
{
sum+=nums[i];
if(sum>maxsum)
maxsum=sum;
}
if(sum<=0)
{
sum=nums[i];
if(sum>maxsum)
maxsum=sum;
}
}
return maxsum;
}
};