暴力循环法
class Solution {
public int maxSubArray(int[] nums) {
int max = nums[0];
int temp = 0;
for (int i = 0; i < nums.length; i++) {
for (int j = i; j < nums.length; j++) {
temp+=nums[j];
if(temp > max) {
max = temp;
}
if(temp < 0) {
break;
}
}
temp = 0;
}
return max;
}
}