LeetCode-----53. Maximum Subarray(最大子集合)

最新推荐文章于 2020-12-15 16:37:27 发布

nameix

最新推荐文章于 2020-12-15 16:37:27 发布

阅读量367

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/nameix/article/details/52957000

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

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.

Subscribe to see which companies asked this question

要求：连续，至少包含1个元素；

包含一个数组，保存以I开头的最大sum。

但是可以用sum=0;max();

public class Solution {
    public int maxSubArray(int[] A) {
        if (A == null || A.length == 0){
            return 0;
        }
        
        int max = Integer.MIN_VALUE, sum = 0;
        for (int i = 0; i < A.length; i++) {
            sum += A[i];
            max = Math.max(max, sum);
            sum = Math.max(sum, 0);
        }

        return max;
    }
}