[LeetCode] Maximum Subarray

最新推荐文章于 2021-10-21 15:55:14 发布

原创最新推荐文章于 2021-10-21 15:55:14 发布 · 469 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #C++

LeetCode 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一种寻找含至少一个数的连续子数组并求其最大和的算法。以[-2,1,-3,4,-1,2,1,-5,4]为例，[4,-1,2,1]具有最大和为6。文章提供了一个O(n)复杂度的解决方案，并提及了分治法作为一种替代方案。

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.

click to show more practice.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

try coding another solution using the divide and conquer approach，题目提示了用分而治之的方法解。

不过这里给出一种可以参考的方法，很简单。

class Solution {
public:
	int maxSubArray(int A[], int n) {
		int sum = A[0], max = A[0];
		for (int i = 1; i < n; i++)
		{
			if (sum < 0)
				sum = A[i];
			else
				sum += A[i];
			if (sum > max)
				max = sum;
		}
		return max;
	}
};