LeetCode 53. Maximum Subarray

description：

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 class Solution {
public int maxSubArray(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
int sum = 0;
int maxValue = Integer.MIN_VALUE;
for (int i = 0; i < nums.length; i++) {
sum += nums[i];
maxValue = Math.max(maxValue, sum);
sum = Math.max(0, sum);
}
return maxValue;
}
}