Leetcode no. 53

SmithZz

于 2016-05-26 00:14:19 发布

阅读量254

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.csdn.net/SmithZz/article/details/51503214

leetcode 专栏收录该内容

114 篇文章

订阅专栏

本文介绍了一种寻找数组中连续子数组并求其最大和的算法实现。以示例[-2,1,-3,4,-1,2,1,-5,4]为例，详细解释了如何找到最大和为6的子数组[4,-1,2,1]。通过提供的Java代码示例，展示了具体的算法逻辑。

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

53. Maximum Subarray

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.

public class Solution {
    public int maxSubArray(int[] nums) {
        if (nums.length==0) return 0;
        int sum=nums[0], cur=0;
        for (int i = 0; i < nums.length; i++) {
            cur+= nums[i];
            if (cur> sum) sum= cur;
            if (cur<0) cur=0;
        }
        return sum;
    }
}