class Solution {
public int maxSubArray(int[] nums) {
int res = Integer.MIN_VALUE;
int cur = 0;
for (int i = 0; i < nums.length; i++) {
if (cur <= 0) {
cur = nums[i];
} else {
cur += nums[i];
}
if (res < cur) {
res = cur;
}
}
return res;
}
}
剑指 Offer 42. 连续子数组的最大和
最新推荐文章于 2022-06-11 07:30:00 发布