动态规划
综述
一维
思路
题目
最大连续子数组和
-注意边界条件,res赋值是nums[0],数组长度为1时需要单独提出。
public int maxSubArray(int[] nums) {
if (nums.length==1)return nums[0];
int res = nums[0];
int[] dp = new int[nums.length];
dp[0] = nums[0];
for (int i = 1; i < dp.length; i++) {
dp[i] = Math.max(dp[i-1]+nums[i],nums[i]);
res = Math.max(res,dp[i]);
}
return res;
}
最长上升子序列
public int lengthOfLIS(int[] nums) {
if (nums==null||nums.length==0)return 0;
int[] dp = new int[nums.length];
if (nums.length==1)return 1;
int res = 0;
Arrays.fill(dp,1);
for (int i = 1; i < nums.length; i++) {
for (int j = i-1; j >= 0; j--) {
if (nums[j]<nums[i]){
dp[i] = Math.max(dp[i],dp[j]+1);
}
}
res = Math.max(res,dp[i]);
}
return res;
}
两个字符的删除操作
class Solution {
public int minDistance(String word1, String word2) {
if (word1.length()==0)return word2.length();
if (word2.length()==0)return word1.length();
int[][] dp = new int[word1.length()+1][word2.length()+1];
int res = Integer.MAX_VALUE;
for (int i = 0; i < dp.length; i++) {
dp[i][0] = i;
}
for (int i = 0; i < dp[0].length; i++) {
dp[0][i] = i;
}
for (int i = 1; i < dp.length; i++) {
for (int j = 1; j < dp[0].length; j++) {
if (word1.charAt(i-1)==word2.charAt(j-1)){
dp[i][j] = Math.min(dp[i-1][j-1],Math.min(dp[i][j-1],dp[i-1][j])+1);
}else
dp[i][j] = Math.min(dp[i][j-1],dp[i-1][j])+1;
}
}
return dp[dp.length-1][dp[0].length-1];
}
}