输入一个整型数组,数组中的一个或连续多个整数组成一个子数组。求所有子数组的和的最大值。
要求时间复杂度为O(n)。
示例1:
输入: nums = [-2,1,-3,4,-1,2,1,-5,4]
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。
提示:
1 <= arr.length <= 10^5
-100 <= arr[i] <= 100
注意:本题与主站 53 题相同:https://leetcode-cn.com/problems/maximum-subarray/
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
连续子序列的最大和,和我之前的做法不一样,看来算法还是得疯狂刷题才行,具体思路是这样的,定义一个求最大的maxSum,定义一个求和的sum,然后开始循环遍历数组,每次都加入sum中,再让sum 和 maxSum进行比较,如果此时sum小于0,说明如果再加正数的话就没必要,再加负数的话就更小了,所以让sum = 0,举例说明
nums = [-2,1,-3,4,-1,2,1,-5,4]
sum = -2,maxSum = -2, sum = 0;
sum = 1,maxSum = 1, sum = 1;
sum = -2,maxSum = 1, sum = 0;
sum = 4,maxSum = 4, sum = 4;
sum = 3,maxSum = -2, sum = 3;
sum = 5,maxSum = 5, sum = 5;
sum = 6,maxSum = 6, sum = 6;
sum = 1,maxSum = 6, sum = 1;
sum = -4,maxSum = 6, sum = 0;
sum = 4,maxSum = 6, sum = 4;
所以最后的结果是6
class Solution {
public int maxSubArray(int[] nums) {
int maxSum = -99999;
int sum = 0;
for(int i = 0; i < nums.length; i++) {
sum += nums[i];
maxSum = Math.max(maxSum,sum);
if(sum < 0) {
sum = 0;
}
}
return maxSum;
}
}