[LeetCode]53. 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.

动态规划

代码如下：

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