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(null == nums){
return -1;
}
if(nums.length==0){
return 0;
}
int maxSum = -9999;
int currentSum = 0;
for(int i=0;i< nums.length;i++){
currentSum += nums[i];
if(currentSum > maxSum){
maxSum = currentSum;
}
if(currentSum < 0) {
currentSum =0;
}
}
return maxSum;
}
}