提交代码
class Solution {
public int maxSubArray(int[] nums) {
int maxSum=Integer.MIN_VALUE,curSum=Integer.MIN_VALUE;
for(int i=0;i<nums.length;i++) {
if(curSum<0) {
curSum=nums[i];
maxSum=maxSum>curSum?maxSum:curSum;
}else {
curSum+=nums[i];
maxSum=maxSum>curSum?maxSum:curSum;
}
}
return maxSum;
}
}