LeetCode(53):最大子序和
给定一个整数数组 nums ,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。
示例:
输入: [-2,1,-3,4,-1,2,1,-5,4]
输出: 6
解释: 连续子数组 [4,-1,2,1] 的和最大,为 6。
题解一:贪心算法
class Solution {
// 贪心算法
public int maxSubArray(int[] nums) {
if(nums == null || nums.length == 0) return 0;
int max = nums[0]; // 最大值
int temp = nums[0]; // 当前和
// 舍弃之前
for(int i=1;i<nums.length;i++){
if(temp<=0){
temp = nums[i];// 舍弃
}else{
temp += nums[i];// 叠加计算
}
if(max<temp){
max = temp;// 最大值替换
}
}
return max;
}
}
题解二:动态规划
class Solution {
// 动态规划
public int maxSubArray(int[] nums) {
if(nums == null || nums.length == 0) return 0;
int pre = 0;
int max = nums[0];
for(int i : nums){
pre = Math.max(pre+i,i);
max = Math.max(max,pre);
}
return max;
}
}
题解二:分治
待理解!
class Solution {
public class Status {
public int lSum, rSum, mSum, iSum;
public Status(int lSum, int rSum, int mSum, int iSum) {
this.lSum = lSum;
this.rSum = rSum;
this.mSum = mSum;
this.iSum = iSum;
}
}
public int maxSubArray(int[] nums) {
return getInfo(nums, 0, nums.length - 1).mSum;
}
public Status getInfo(int[] a, int l, int r) {
if (l == r) {
return new Status(a[l], a[l], a[l], a[l]);
}
int m = (l + r) >> 1;
Status lSub = getInfo(a, l, m);
Status rSub = getInfo(a, m + 1, r);
return pushUp(lSub, rSub);
}
public Status pushUp(Status l, Status r) {
int iSum = l.iSum + r.iSum;
int lSum = Math.max(l.lSum, l.iSum + r.lSum);
int rSum = Math.max(r.rSum, r.iSum + l.rSum);
int mSum = Math.max(Math.max(l.mSum, r.mSum), l.rSum + r.lSum);
return new Status(lSum, rSum, mSum, iSum);
}
}
链接:https://leetcode-cn.com/problems/maximum-subarray/solution/zui-da-zi-xu-he-by-leetcode-solution/