class Solution {
public int maxSubArray(int[] nums) {
int max = nums[0];
int tem = 0;
for(int i = 0;i < nums.length;i++) {
tem = Math.max(nums[i] + tem,nums[i]);
max = Math.max(max,tem);
}
return max;
}
LeetCode-05-53最大子序和
最新推荐文章于 2024-06-22 22:59:06 发布