Maximum Subarray

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

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

0 ·

CC 4.0 BY-SA版权

leetCode 同时被 2 个专栏收录

39 篇文章

订阅专栏

29 篇文章

订阅专栏

本文介绍了一种算法来找到给定数组中具有最大和的连续子数组，通过使用前缀和数组和动态更新最小前缀和，提高了查找效率。

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(int A[], int n) {
        if(n <= 0)return 0;

		for(int i = 1; i < n; i++)
			A[i] += A[i - 1];
		int maxsum = INT_MIN;
		int minsum = 0;//最开始minsum为0 
		for(int i = 0; i < n; i++)
		{
			maxsum = max(maxsum, A[i] - minsum);//先计算当前的最大值再更新 minsum
			minsum = min(minsum, A[i]);
			
		}
		return maxsum;
    }
};