LeetCode题解：Maximum Subarray

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.

题意：找出数组中和最大的子数组

解题思路：DP

代码：

public class Solution {    public int maxSubArray(int[] nums) {        int maxSoFar=nums[0];        int maxEndingHere=nums[0];        for (int i = 1; i < nums.length; ++i){            maxEndingHere = Math.max(maxEndingHere + nums[i], nums[i]);            maxSoFar = Math.max(maxSoFar, maxEndingHere);         }        return maxSoFar;    }}