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.

思路：去年算法课的一道作业题，连续求一段和，若大于零则保留，小于零则抛弃，重新累加求和，记录下中间过程中的最大者即为答案。

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