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.
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
代码语言：javascript复制 public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int curSum = nums[0];
int maxSum = nums[0];
for (int i = 1; i < nums.length; i ) {
curSum = Math.max(curSum nums[i], nums[i]);
maxSum = Math.max(curSum, maxSum);
}
return maxSum;
}
