算法的一些小栗子9（动态规划算法）

来源：互联网发布：人口数据在哪里查编辑：程序博客网时间：2024/05/17 08:44

动态规划算法

//动态规划算法求最长子序列public class LCS {    public int findLCS(String A, String B) {        int n = A.length();        int m = B.length();        char[] a = A.toCharArray();        char[] b = B.toCharArray();        int[][] dp = new int[n][m];        for (int i = 0; i < n; i++) {//第一列            if (a[i] == b[0]) {                dp[i][0] = 1;                for (int j = i + 1; j < n; j++) {                    dp[j][0] = 1;                }                break;            }        }        for (int i = 0; i < m; i++) {            if (a[0] == b[i]) {                dp[0][i] = 1;                for (int j = i + 1; j < m; j++) {                    dp[0][j] = 1;                }                break;            }        }        for (int i = 1; i < n; i++) {            for (int j = 1; j < m; j++) {                if (a[i] == b[j]) {                    dp[i][j] = dp[i - 1][j - 1] + 1;                } else {                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);                }            }        }        for (int i = 0; i < n; i++) {            for (int j = 0; j < m; j++) {                System.out.print(dp[i][j] + " ");            }            System.out.println();        }        return dp[n - 1][m - 1];    }    public static void main(String[] args) {        LCS lcs = new LCS();        int findlcs = lcs.findLCS("happy", "hard");        System.out.println("最长子序列长度：" + findlcs);    }}

阅读全文

0 0