53. Maximum Subarray
Easy
3787132FavoriteShare
Given an integer array nums
, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4], Output: 6 Explanation: [4,-1,2,1] has the largest sum = 6.
这道题我想了很久,一开始有点难以理解,AC代码如下:代码其实很简单。主要是方法,这道题的解法就是一个个把数字取出来加一起,和是sum,如果发现上一次算出来的和sum<0, 那么扔掉之前所有的和sum(sum=0),从当前这个数开始,重新算sum。过程中一直监视sum这个值的最大值,发现最大值立刻取出。
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int previoussum=0x80000000;
int sum=0;
for(int i=0;i<nums.size();i++)
{
if(sum<0)sum=0;
sum+=nums[i];
previoussum=max(previoussum,sum);
}
return previoussum;
}
};