很经典的一道题,在数据结构课程中也涉及到过,使用贪心是最优解,达到O(n)的时间复杂度
下面给出解释:
class Solution {
public int maxSubArray(int[] nums) {
int res = nums[0];
int sum = 0;
for (int num : nums) {
if (sum > 0){
sum += num;
} else {
sum = num;
}
res = Math.max(res, sum);
}
return res;
}
public static void main(String[] args) {
int[] arr = {-2,1,-3,4,-1,2,1,-5,4};
int res = new Solution().maxSubArray(arr);
System.out.println(res);
}
}