leetcode - Maximum Subarray

最新推荐文章于 2024-05-06 23:09:19 发布

AkibaTakuya

最新推荐文章于 2024-05-06 23:09:19 发布

阅读量486

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/AkibaTakuya/article/details/40383911

leetcode 专栏收录该内容

155 篇文章

订阅专栏

本文介绍了一种寻找含至少一个数的连续子数组并求其最大和的算法。以[-2,1,-3,4,-1,2,1,-5,4]为例，连续子数组[4,-1,2,1]具有最大和6。文中提供了一个O(n)复杂度的解决方案，并鼓励尝试使用更微妙的分治策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

class Solution {
public:
    int maxSubArray(int A[], int n) {
		int max = A[0],s = A[0];
		for (int i = 1; i < n; i++)
		{
			if(s < 0)
			{
				s = A[i];
			}
			else
			{
				s += A[i];
			}
			if(max < s)
			{
				max = s;
			}
		}
#if 0
		std::cout << max << std::endl;
#endif // 1

		return max;
    }
};