42 连续子数组的最大和

chasein

于 2020-09-19 16:48:09 发布

阅读量100

点赞数

分类专栏：剑指offer

本文链接：https://blog.youkuaiyun.com/weixin_40804971/article/details/108683115

版权

剑指offer 专栏收录该内容

22 篇文章

订阅专栏

    public int FindGreatestSumOfSubArray(int[] array) {
        int sum = 0;
        int maxSum = Integer.MIN_VALUE;
        for(int i = 0; i < array.length; ++i){
           sum += array[i];
            
            if(sum > maxSum){
                maxSum = sum;
            }
            if(sum < 0)
               sum = 0;
        }
        return maxSum;
    }