Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
Follow up:
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[] nums) {
Integer[] a = new Integer[nums.length];//第n个元素之前的最大和
a[0] = nums[0];//
int max = nums[0];
for (int i = 1; i < a.length; i++) {
if (a[i-1] > 0)
a[i] = a[i-1] + nums[i];
else//如果最大和小于0 可以抛弃前面的子段
a[i] = nums[i];
if (a[i] > max)
max = a[i];
}
return max;
}
}