leetcode------583. 两个字符串的删除操作（最长公共序列模板）[1]

最新推荐文章于 2023-09-12 23:26:14 发布

qiang_____0712

最新推荐文章于 2023-09-12 23:26:14 发布

阅读量339

点赞数

分类专栏：程序片段文章标签：最长公共子序列最长公共子串

本文链接：https://blog.youkuaiyun.com/qiang_____0712/article/details/84455061

版权

程序片段专栏收录该内容

107 篇文章

订阅专栏

问题描述：https://leetcode-cn.com/problems/delete-operation-for-two-strings/description/

考察最长公共序列

class Solution {
public:
    
    static int lcs(string str1, string str2) 
    {
    int len1 = str1.length();
    int len2 = str2.length();
    int **c=new int *[len1+1];    
    for(int i=0;i<len1+1;i++)
         c[i]= new int[len2+1];//为每行分配空间（每行中有col个元素） 
        
    for (int i = 0; i <= len1; i++) {
        for( int j = 0; j <= len2; j++) {
            if(i == 0 || j == 0) {
                c[i][j] = 0;
            } else if (str1[i-1] == str2[j-1]) {
                c[i][j] = c[i-1][j-1] + 1;
            } else {
                c[i][j] = max(c[i - 1][j], c[i][j - 1]);
            }
        }
    }
    return c[len1][len2];
   }
    
    int minDistance(string word1, string word2) {
       return word1.length()+ word2.length()-2*lcs(word1,word2);
    }
};