题目链接:https://leetcode-cn.com/problems/maximum-subarray/
方法一:动态规划
求解关键:连续子数组的问题,一般着眼于,以当前元素结尾的子数组,来简化问题。
public class Solution {
// 给定一个整型数组 nums ,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。
/**
* 定义状态:
* dp[i] : 表示以 nums[i] 结尾的连续子数组的最大和
* <p>
* 状态转移方程:
* dp[i] = max{num[i],dp[i-1] + num[i]}
*/
public int maxSubArray(int[] nums) {
int len = nums.length;
if (len == 0) {
return 0;
}
int[] dp = new int[len];
dp[0] = nums[0];
for (int i = 1; i < len; i++) {
dp[i] = Math.max(nums[i], dp[i - 1] + nums[i]);
}
// 最后这一步,是求一个全局的最优值
int res = dp[0];
for (int i = 1; i < len; i++) {
res = Math.max(res,dp[i]);
}
return res;
}
}
方法二:分治法
/**
* 使用分治算法完成计算
*/
public int maxSubArray(int[] nums) {
int len = nums.length;
if (len == 0) {
return 0;
}
return maxSubArraySum(nums, 0, len - 1);
}
/**
* 一定会包含 nums[mid] 这个元素
*/
private int maxCrossingSum(int[] nums, int l, int m, int r) {
int sum = 0;
int leftSum = Integer.MIN_VALUE;
for (int i = m; i >= l; i--) {
sum += nums[i];
if (sum > leftSum) {
leftSum = sum;
}
}
sum = 0;
int rightSum = Integer.MIN_VALUE;
for (int i = m + 1; i <= r; i++) {
sum += nums[i];
if (sum > rightSum) {
rightSum = sum;
}
}
return leftSum + rightSum;
}
private int maxSubArraySum(int[] nums, int l, int r) {
if (l == r) {
return nums[l];
}
int mid = l + (r - l) / 2;
return max3(maxSubArraySum(nums, l, mid),
maxSubArraySum(nums, mid + 1, r),
maxCrossingSum(nums, l, mid, r));
}
private int max3(int num1, int num2, int num3) {
return Math.max(num1, Math.max(num2, num3));
}