class Solution {
public int maxSubArray(int[] nums) {
if(nums==null||nums.length<1){
return 0;
}
int cursum=0;
int maxSum=Integer.MIN_VALUE;
for(int i=0;i<nums.length;i++){
if(cursum<=0){
cursum=nums[i];
}else{
cursum+=nums[i];
}
maxSum=Math.max(maxSum,cursum);
}
return maxSum;
}
}
leetcode 53. 最大子序和
最新推荐文章于 2019-12-06 16:04:14 发布