[Lintcode]Longest Common Subsequence 最长公共子序列

青铁

于 2016-10-18 18:31:47 发布

阅读量1k

点赞数

分类专栏：算法文章标签： lintcode

本文链接：https://blog.csdn.net/jc69186918/article/details/52851410

版权

算法专栏收录该内容

191 篇文章

订阅专栏

本文介绍了一种使用二维动态规划方法来寻找两个字符串之间的最长公共子序列（LCS）的有效算法。通过实例演示了如何计算不同字符串组合的LCS长度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two strings, find the longest common subsequence (LCS).

Your code should return the length of LCS.

Example

For "ABCD" and "EDCA", the LCS is "A" (or "D", "C"), return 1.

For "ABCD" and "EACB", the LCS is "AC", return 2.

二维DP。

public class Solution {
    /**
     * @param A, B: Two strings.
     * @return: The length of longest common subsequence of A and B.
     */
    public int longestCommonSubsequence(String A, String B) {
        if(A.length() == 0 || B.length() == 0) return 0;

        int[][] res = new int[A.length()][B.length()];
        res[0][0] = A.charAt(0) == B.charAt(0) ? 1 : 0;
        for(int i = 1; i < A.length(); i++) res[i][0] = A.charAt(i) == B.charAt(0) ? 1 : 0;
        for(int j = 1; j < B.length(); j++) res[0][j] = B.charAt(j) == A.charAt(0) ? 1 : 0;
        for(int i = 1; i < A.length(); i++) {
            for(int j = 1; j < B.length(); j++) {
                if(A.charAt(i) == B.charAt(j)) {
                    res[i][j] = res[i - 1][j - 1] + 1;
                } else {
                    res[i][j] = Math.max(res[i - 1][j], res[i][j - 1]);
                }
            }
        }
        return res[A.length() - 1][B.length() - 1];
    }
}