编程习题——Maximum Subarray

最新推荐文章于 2022-12-07 19:14:29 发布

转载最新推荐文章于 2022-12-07 19:14:29 发布 · 143 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/YESheng/p/3668326.html

本文介绍了一种寻找具有最大和的连续子数组的算法实现。通过一个具体的例子[-2,1,-3,4,-1,2,1,-5,4]展示了如何找到最大和为6的子数组[4,-1,2,1]。该算法使用了动态规划的思想，通过维护一个累加和数组来跟踪当前最大子数组的和。

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 Test08 {

    public static void main(String[] args) {
        int[] nums = { -2, 1, -3, 4, -1, 2, 1, -5, 4 };

        int[] sums = new int[nums.length];
        int max = nums[0];
        sums[0] = nums[0];
        for (int i = 1; i < nums.length; i++) {
            sums[i] = Math.max(nums[i], nums[i] + sums[i - 1]);
            max = Math.max(max, sums[i]);
        }
        System.out.println(max);
    }

}