public class Main {
public static void main(String[] args) {
int[] nums = {-2,1,-3,4,-1,2,1,-5,4};
int max = maxSubArray(nums);
System.out.println(max);
}
public static int maxSubArray(int[] nums) {
int result=Integer.MIN_VALUE;
int count=0;
for(int i=0;i<nums.length;i++){
count=count+nums[i];
if(count>result){
result=count;
}
if(count<0){
count=0;
}
}
return result;
}
}
java相关-贪心算法-最大子数组和-力扣53
最新推荐文章于 2025-12-02 21:20:38 发布
475

被折叠的 条评论
为什么被折叠?



