LCS(Longest Common Subsequence/Substring)

hz5034

已于 2023-03-19 21:55:10 修改

阅读量619

点赞数

文章标签： c++ 算法 c语言

于 2014-09-23 22:23:06 首次发布

本文链接：https://blog.csdn.net/hz5034/article/details/39505613

版权

1.Longest Common Subsequence

#include<iostream>
using namespace std;
#define m 7
#define n 6
char X[m],Y[n];
char c[m+1][n+1],b[m][n];

void lcs_length(char *X,char *Y)
{
    int i,j;
    for(i=0;i<=m;i++)c[i][0]=0;
    for(j=1;j<=n;j++)c[0][j]=0;
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
        {
            if(X[i-1]==Y[j-1])
            {
                c[i][j]=c[i-1][j-1]+1;
                b[i-1][j-1]=1;
            }
            else if(c[i-1][j]>=c[i][j-1])
            {
                c[i][j]=c[i-1][j];
                b[i-1][j-1]=2;
            }
            else
            {
                c[i][j]=c[i][j-1];
                b[i-1][j-1]=3;
            }
        }
    }
}

void print_lcs(char *X,int i,int j)
{
    if(i==0||j==0)return;
    if(b[i-1][j-1]==1)
    {
        print_lcs(X,i-1,j-1);
        cout<<X[i-1];
    }
    else if(b[i-1][j-1]==2)print_lcs(X,i-1,j);
    else print_lcs(X,i,j-1);
}

int main()
{
    strcpy(X,"ABCBDAB");
    strcpy(Y,"BDCABA");
    lcs_length(X,Y);
    print_lcs(X,m,n);
    cout<<endl;
    return 0;
}

2.Longest Common Substring

#include<iostream>
#include<limits>
using namespace std; 
#define m 7  
#define n 6  
char X[m],Y[n];  
char c[m+1][n+1];  

void lcs(char *X,char *Y)
{
    int i,j,k,max=INT_MIN;
    for(i=0;i<=m;i++)c[i][0]=0;
    for(j=1;j<=n;j++)c[0][j]=0;
    for(i=1;i<=m;i++)
    {
        for(j=1;j<=n;j++)
        {
            if(X[i-1]==Y[j-1])c[i][j]=c[i-1][j-1]+1;
            else c[i][j]=0;
            if(c[i][j]>max)
            {
                max=c[i][j];
                k=i-1;
            }
        }
    }
    for(i=k-max+1;i<=k;i++)cout<<X[i];
}

int main()
{
    strcpy(X,"ABCBDAB");  
    strcpy(Y,"BDCABA");  
    lcs(X,Y);
    cout<<endl;  
    return 0;
}