23、最长公共子序列

最新推荐文章于 2024-07-29 14:22:26 发布

qq228960677

最新推荐文章于 2024-07-29 14:22:26 发布

阅读量50

点赞数

分类专栏：蓝桥杯文章标签： java 算法数据结构

本文链接：https://blog.csdn.net/qq_29008857/article/details/128744109

版权

蓝桥杯专栏收录该内容

33 篇文章 1 订阅

订阅专栏

 public static void main(String[] args) {
        String s1 = "ab";
        String s2 = "bab";
        int commonLen = getFun(s1, s2);
        System.out.println(commonLen);
    }

    private static int getFun(String s1, String s2) {
        char[] c1 = s1.toCharArray();
        char[] c2 = s2.toCharArray();
        int[][] a = new int[c1.length + 1][c2.length + 1];

        for (int i = 1; i < a.length; i++)
            for (int j = 1; j < a[i].length; j++) {
                if (c1[i - 1] == c2[j - 1]) {
                    a[i][j] = a[i - 1][j - 1] + 1;
                } else if (a[i - 1][j] > a[i][j - 1]) {
                    a[i][j] = a[i - 1][j];
                } else {
                    a[i][j] = a[i][j - 1];
                }
            }
        int max = 0;
        for (int i = 1; i < a.length; i++)
            for (int j = 1; j < a[i].length; j++) {
                if (a[i][j] > max)
                    max = a[i][j];
            }

        return max;
    }