53. Maximum Subarray

最新推荐文章于 2025-05-15 16:32:28 发布

原创最新推荐文章于 2025-05-15 16:32:28 发布 · 233 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种寻找含至少一个数的连续子数组并求其最大和的算法。以[-2,1,-3,4,-1,2,1,-5,4]为例，[4,-1,2,1]具有最大和为6。通过遍历数组，当累积和小于等于0时重新开始计数，确保找到最大子数组和。

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) {
if(nums.size()==0)
return 0;
else if(nums.size()==1)
return nums[0];

int sum = nums[0];
int re = sum;

for(int i = 1; i < nums.size(); ++i)
{
if(sum <= 0)
sum = nums[i];
else
sum += nums[i];
re = max(sum, re);
}
return re;
}
};