Maximum-subarray

最新推荐文章于 2020-04-07 22:43:52 发布

原创最新推荐文章于 2020-04-07 22:43:52 发布 · 270 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种寻找具有最大和的连续子数组的算法，并提供了一个简洁的O(n)解决方案。该算法通过迭代数组，使用动态规划思想来解决此问题。

题目描述

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.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

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

this topic can use the dynamic programming