leetcode 53. Maximum Subarray

最新推荐文章于 2025-09-10 22:03:14 发布

zbxzc

最新推荐文章于 2025-09-10 22:03:14 发布

阅读量395

点赞数

CC 4.0 BY-SA版权

分类专栏：数据结构与算法 OJ 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/u014568921/article/details/50992908

数据结构与算法同时被 2 个专栏收录

213 篇文章

订阅专栏

196 篇文章

订阅专栏

本文介绍了一个算法用于找到数组中具有最大和的连续子数组，通过遍历数组并跟踪当前子数组的和来实现。

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.

int maxSubArray(int* nums, int numsSize) {
	if (numsSize == 0)
		return 0;
	int maxsum = -1000000;
	int k = 0;
	bool f = false;
	while (k < numsSize)
	{
		while (k < numsSize&&nums[k] <= 0)
			k++;
		int sum = 0;
		while (k < numsSize)
		{
			f = true;
			sum += nums[k];
			if (sum > maxsum)
				maxsum = sum;
			if (sum <= 0)
				break;
			k++;
		}
	}
	if (!f)
	{
		maxsum = nums[0];
		for (int i = 1; i < numsSize; i++)
			if (nums[i]>maxsum)
				maxsum = nums[i];
		return maxsum;
	}
	return maxsum;
}

accepted