42、连续子数组的最大和

gongdileidechouzhu

于 2018-03-28 09:31:37 发布

阅读量176

点赞数

CC 4.0 BY-SA版权

分类专栏：剑指offer

本文链接：https://blog.youkuaiyun.com/gongdileidechouzhu/article/details/79722720

剑指offer 专栏收录该内容

61 篇文章

订阅专栏

1、用数组保存起来p220的f(i)

public class Solution {
    public int FindGreatestSumOfSubArray(int[] array) {
        if(array.length<1) return 0;
        int max = array[0];
        int[] endWithIndexISum = new int[array.length];
        endWithIndexISum[0] = array[0];
        for(int i=1;i<array.length;i++)
        {
            if(endWithIndexISum[i-1]<0)
                endWithIndexISum[i] = array[i];
            else
                endWithIndexISum[i] = endWithIndexISum[i-1]+array[i];
            if(endWithIndexISum[i]>max)
                max = endWithIndexISum[i];
        }
        return max;
    }
}

2、没有保存

public class Solution {
    public int FindGreatestSumOfSubArray(int[] array) {
        if(array.length<1) return 0;
        int max = array[0];
        int endWithIndexISum;
        int PreEndWithIndexISum=array[0];
        for(int i=1;i<array.length;i++)
        {
            if(PreEndWithIndexISum<0)
                endWithIndexISum = array[i];
            else
                endWithIndexISum = PreEndWithIndexISum+array[i];
            if(endWithIndexISum>max)
                max = endWithIndexISum;
            PreEndWithIndexISum = endWithIndexISum;
        }
        return max;
    }
}