算法动态规划

初心魏

于 2024-08-19 21:39:12 发布

阅读量119

点赞数 2

文章标签：算法动态规划

本文链接：https://blog.csdn.net/qq_42306803/article/details/141098102

版权

算法动态规划

一、动态规划

一、动态规划

1.1 编辑距离

public int editDistance (String str1, String str2) {
        // write code here
        if(str1 == null || str2 == null){
            return 0;
        }
        if(str1.length() == 0){
            return str2.length();
        }
        if(str2.length() == 0){
            return str1.length();
        }
        int[][] dp = new int[str1.length() + 1][str2.length() + 1];
        for (int i = 0; i < str1.length() + 1; i++) {
            dp[i][0] = i;
        }
        for (int i = 0; i < str2.length() + 1; i++) {
            dp[0][i] = i;
        }
        for (int i = 1; i < str1.length()+1; i++) {
            for (int j = 1; j < str2.length()+1; j++) {
                if(str1.charAt(i-1) != str2.charAt(j-1)){
                    dp[i][j] = Math.min(Math.min(dp[i-1][j] + 1, dp[i][j-1]+1),dp[i-1][j-1]+1);
                }else {
                    dp[i][j] = dp[i-1][j-1];
                }
            }
        }
        return dp[str1.length()][str2.length()];
    }

1.2 抢家劫舍（一）

无循环

 public static int rob (int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        // write code here
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        for (int i = 1; i < nums.length; i++) {
            if (i == 1) {
                dp[i] = Math.max(dp[0], nums[1]);
            } else {
                dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
            }
        }
        return dp[nums.length - 1];
    }

1.3 抢家劫舍（二）

循环抢

 public static int rob(int[] nums) {
        int num1 = robFin(Arrays.copyOfRange(nums, 0, nums.length - 1));
        int num2 = robFin(Arrays.copyOfRange(nums, 1, nums.length));
        return Math.max(num1, num2);
    }
    public static int robFin (int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        // write code here
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        for (int i = 1; i < nums.length; i++) {
            if (i == 1) {
                dp[i] = Math.max(dp[0], nums[1]);
            } else {
                dp[i] = Math.max(dp[i - 2] + nums[i], dp[i - 1]);
            }
        }
        return dp[nums.length - 1];
    }

1.4 数字字符串转IP

import java.util.ArrayList;
import java.util.Arrays;

public class main {
    public static void main(String[] args) {
        restoreIpAddresses("25525522135");

    }
    public static ArrayList<String> list = new ArrayList<>();
    public static ArrayList<String> restoreIpAddresses(String s) {
        if(s == null && s.length() == 0 && s.length() < 4){
            return list;
        }
        restoreIpAddressesTmp(s, "", 0);
        return list;
    }
    public static void restoreIpAddressesTmp (String s, String tmp, int part) {
        if(s == null){
            return;
        }
        if(part == 4 && s.length() == 0){
            list.add(tmp.substring(0, tmp.length() - 1));
            return;
        }
        if(part > 4){
            return;
        }
        // write code here

        if(s.length() >= 1){
            Integer num = Integer.valueOf(s.substring(0, 1));
            restoreIpAddressesTmp(s.substring(1,s.length()), new StringBuilder(tmp).append(num).append(".").toString(), part +1);
        }

        if(s.length() >= 2){
            Integer num = Integer.valueOf(s.substring(0, 2));
            if ( num >= 10 && num <= 99){
                restoreIpAddressesTmp(s.substring(2,s.length()), new StringBuilder(tmp).append(num).append(".").toString(), part +1);
            }
        }
        if(s.length() >= 3){
            Integer num = Integer.valueOf(s.substring(0, 3));
            if ( num >= 100 && num <= 255){
                restoreIpAddressesTmp(s.substring(3,s.length()), new StringBuilder(tmp).append(num).append(".").toString(), part +1);
            }
        }
    }
}

1.5 最长回文串

只需要考虑以当前为中心和当前及右边字母组合为中心2种情况。

public static int getLongestPalindrome (String A) {
        if(A == null || A.length() == 0){
            return 0;
        }
        if(A.length() == 1){
            return 1;
        }
        // write code here
        //dp:以当前字符为中心的最长回文串
        int[] dp = new int[A.length()];
        dp[0] = 1;
        int max = 0;
        for (int i = 0; i < A.length(); i++) {
            int left = i - 1;
            int right = i + 1;
            int count = 1;
            while (left >= 0 && right < A.length() ){
                if(A.charAt(left) == A.charAt(right)){
                    left --;
                    right ++;
                    count = count + 2;
                }else {
                    break;
                }
            }
            int count1 = 0;
            int left1 = i;
            int right1 = i + 1;
            if(right1 < A.length() && A.charAt(left1) == A.charAt(right1)){
                count1 = 2;
                left1 --;
                right1 ++;
                while (left1 >= 0 && right1 < A.length() ){
                    if(A.charAt(left1) == A.charAt(right1)){
                        left1 --;
                        right1 ++;
                        count1 = count1 + 2;
                    }else {
                        break;
                    }
                }
            }
            dp[i] = Math.max(count, count1);
            max = Math.max(max,dp[i]);
        }
        return max;
    }

1.6 最长严格上升子序列

public static int LIS(int[] arr) {
        if (arr == null || arr.length == 0) {
            return 0;
        }
        // write code here
        int dp[] = new int[arr.length];
        dp[0] = 1;
        int max = 1;
        for (int i = 1; i < arr.length; i++) {
            int tmp = 1;
            for (int j = 0; j < i; j++) {
                if (arr[i] > arr[j] && dp[j] + 1 >= tmp) {
                    tmp = dp[j] + 1;
                }
            }
            dp[i] = tmp;
               max = Math.max(dp[i], max);
        }
        return max;
    }

1.7 零钱兑换

递归思路

public static int minMoneyTry (int[] arr, int aim, int time) {
        // write code here
        Arrays.sort(arr);
        if(aim == 0){
            return time;
        }
        if(aim < arr[0]) {
            return -1;
        }
        int min = Integer.MAX_VALUE;
        for (int i = 0; i < arr.length; i++) {
            int tem = minMoneyTry(arr, aim - arr[i], time + 1);
            if(tem < min && tem != - 1){
                min = tem;
            }
        }
        if(min == Integer.MAX_VALUE){
            return -1;
        }
        return min;
    }

动态规划

public static int minMoney (int[] arr, int aim) {
        if(arr == null || arr.length == 0){
            return -1;
        }
        if(aim <= 0){
            return 0;
        }
        int[] dp = new int[aim + 1];
        dp[0] = 0;
        for (int i = 1; i < dp.length; i++) {
            dp[i] = -1;
        }
        for (int i = 0; i < arr.length; i++) {
            if(arr[i] < dp.length){
                dp[arr[i]] = 1;
            }
        }
        for (int i = 1; i < dp.length; i++) {
            if(dp[i] != -1){
                continue;
            }
            int tmp = Integer.MAX_VALUE;
            for (int j = 0; j < arr.length; j++) {
                if (i - arr[j] >= 0 && dp[i - arr[j]] != -1 && dp[i - arr[j]] + 1 < tmp) {
                    dp[i] = dp[i - arr[j]] + 1;
                    tmp = dp[i];
                }
            }
        }
        return dp[aim];
    }

1.8 数字变成字符串有几种方式

1->a

public static int solve (String nums) {
        if(nums == null || nums.length() == 0 || nums.charAt(0) == '0'){
            return 0;
        }
        int[] dp = new int[nums.length() + 1];
        //默认翻译的是1种
        for (int i = 0; i < dp.length; i++) {
            dp[i] = 1;
        }
        for (int i = 1; i < dp.length; i++) {
            if(i-2 >= 0 ){
                Integer integer = Integer.valueOf(nums.substring(i - 2, i));
                if(integer > 10 && integer <= 26 && integer != 20){
                    dp[i] = dp[i-1] + dp[i-2];
                }else if(integer == 10 || integer == 20){
                    dp[i] = dp[i-2];
                }else if(nums.charAt(i-1) != '0'){
                    dp[i] = dp[i-1];
                }else {
                    return 0;
                }
            }
        }
        return dp[dp.length - 1];
    }

1.9 矩阵的最小路径和

public static int minPathSum (int[][] matrix) {
        // write code here
        if(matrix == null || matrix.length == 0 || matrix[0].length == 0){
            return 0;
        }
        int row = matrix.length;
        int col = matrix[0].length;
        int[][] dp = new int[row][col];
        int sum = 0;
        for (int i = 0; i < row; i++) {
            sum = sum + matrix[i][0];
            dp[i][0] = sum;
        }
        sum = 0;
        for (int i = 0; i < col; i++) {
            sum = sum + matrix[0][i];
            dp[0][i] = sum;
        }
        for (int i = 1; i < row; i++) {
            for (int j = 1; j < col; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + matrix[i][j];
            }
        }
        return dp[row-1][col-1];
    }

1.10 不同路径的数目

 public static int uniquePaths (int m, int n) {
        if(m <= 0 || n <= 0){
            return 0;
        }
        // write code here
        int [][] dp = new int[m][n];
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 0; i < n; i++) {
           dp[0][i] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i-1][j] + dp[i][j-1];
            }
        }
        return dp[m-1][n-1];
    }

1.11 最长公共子串(不连续）

public static String LCS (String str1, String str2) {
        if(str1 == null || str2 == null || str1.length() == 0 || str2.length() == 0){
            return "";
        }
        int[][] dp = new int[str1.length()+1][str2.length()+1];
        for (int i = 0; i < str1.length()+1; i++) {
            dp[i][0] = 0;
        }
        for (int i = 0; i < str2.length()+1; i++) {
            dp[0][i] = 0;
        }
        // write code here
        for (int i = 1; i < str1.length()+1; i++) {
            for (int j = 1; j < str2.length()+1; j++) {
                if(str1.charAt(i-1) == str2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else {
                    dp[i][j] = Math.max(dp[i][j-1],Math.max(dp[i-1][j-1], dp[i-1][j]));
                }
            }
        }
        String res = "";
        int i = str1.length();
        int j = str2.length();
        while (i > 0 && j > 0){
            if(str1.charAt(i-1) == str2.charAt(j-1)){
                res = str1.charAt(i-1) + res;
                i --;
                j --;
            }else if(dp[i-1][j] > dp[i][j-1]){
                i --;
            }else {
                j--;
            }
        }
        return res;
    }

1.12 最长公共子串(连续）

public static String LCS (String str1, String str2) {
        if(str1 == null || str2 == null || str1.length() == 0 || str2.length() == 0){
            return "";
        }
        int[][] dp = new int[str1.length()+1][str2.length()+1];
        for (int i = 0; i < str1.length()+1; i++) {
            dp[i][0] = 0;
        }
        for (int i = 0; i < str2.length()+1; i++) {
            dp[0][i] = 0;
        }
        // write code here
        int max = 0;
        int index = 0;
        for (int i = 1; i < str1.length()+1; i++) {
            for (int j = 1; j < str2.length()+1; j++) {
                if(str1.charAt(i-1) == str2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1]+1;
                }else {
                    dp[i][j] = 0;
                }
                if(dp[i][j] > max){
                    max = dp[i][j];
                    index = i;
                }
            }
        }
        return str1.substring(index - max, index);
    }