编程语言:Java
题目链接:https://leetcode-cn.com/problems/maximum-subarray/
题解:无,不想进阶,,,
难度:easy
结果:AC
class Solution {
public int maxSubArray(int[] nums) {
int sum=0;
int res=Integer.MIN_VALUE;
for(int i=0;i<nums.length;i++){
sum+=nums[i];
res=Math.max(sum,res);
if(sum<0)sum=0;
}
return res;
}
}