思路:最大子数组
public class Solution {
public int maxSubArray(int[] nums) {
int sum=0;
int answer=nums[0];
for (int i = 0; i < nums.length; i++) {
sum+=nums[i];
if (sum>answer) {
answer=sum;
}
if (sum<0) {
sum=0;
}
}
return answer;
}
}
耗时:368ms,中游