LeetCode题解：Maximum Subarray

最新推荐文章于 2025-08-13 21:50:19 发布

CheeRok

最新推荐文章于 2025-08-13 21:50:19 发布

阅读量720

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/u012403246/article/details/50799666

LeetCode 专栏收录该内容

152 篇文章

订阅专栏

本文介绍了一种寻找数组中和最大的连续子数组的算法，并提供了一个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.

题意：找出数组中和最大的子数组

解题思路：DP

代码：

public class Solution {
    public int maxSubArray(int[] nums) {
        int maxSoFar=nums[0];
        int maxEndingHere=nums[0];

        for (int i = 1; i < nums.length; ++i){
            maxEndingHere = Math.max(maxEndingHere + nums[i], nums[i]);
            maxSoFar = Math.max(maxSoFar, maxEndingHere); 
        }

        return maxSoFar;
    }
}