方法一
class Solution {
public int maxSubArray(int[] nums) {
if(nums.length == 0)
return 0;
int max = Integer.MIN_VALUE;
int curNum = 0;
for(int i=0;i<nums.length;i++){
if(curNum<= 0){
curNum=nums[i];
}else{
curNum+=nums[i];
}
if(curNum > max)
max = curNum;
System.out.println(max);
}
return max;
}
}
方法二: