最长公共子序列(LCS)

LCS (Longest Common Subsequence)动态规划方法解法

#include <iostream>
#include <cstring>
#include <sstream>
#include <stdio.h>
using namespace std;

void LCSLength(int m, int n, char *x, char *y , int **c){
    /*
    找到字符串x和y最长的公共子序列，子序列可以不连续
    :param m: 字符串x的长度
    :param n: 字符串y的长度
    :param x: 字符串x, 下标从1开始
    :param y: 字符串y, 下标从1开始
    :param c: c[i][j]记录的是子段{x[1], ...,x[i]}与{y[1], ..., y[j]}的LCS大小
              c的下标从1开始, 大小是 c[m+1][n+1]
    */
    for(int i = 0; i <= m; ++i) c[i][0] = 0;  // c[0][0] = 0
    for(int j = 1; j <= n; ++j) c[0][j] = 0;

    for(int i = 1; i <= m; ++i){
        //system("pause");
        for(int j = 1; j <= n; ++j){
            if (x[i] == y[j]){
                c[i][j] = c[i-1][j-1] + 1;
            } else if(c[i-1][j] >= c[i][j-1]){
                c[i][j] = c[i-1][j];
            } else{
                c[i][j] = c[i][j-1];
            }
        }
    } return;
}

void LCS(int i, int j, char *x, int **c){
    /* 打印出LCS */
    if(i == 0 || j == 0) return;
    if((c[i][j]-1 == c[i-1][j])
      && (c[i][j]-1 == c[i][j-1])){
        LCS(i-1, j-1, x, c);
        cout << x[i];
    } else if(c[i-1][j] >= c[i][j-1]){
        LCS(i-1, j, x, c);
    } else{
        LCS(i, j-1, x, c);
    }
}
int main(){
    char x[] = "*ABCBDAB";  // 字符串第一位不使用
    char y[] = "*BDCABA";   // 字符串第一位不使用
    int m = strlen(x)-1;
    int n = strlen(y)-1;
    int **c = new int*[m+1];
    for (int i = 0; i <= m; ++i){
        c[i] = new int[n+1]();  // 每个元素初始化为0
    }
    LCSLength(m, n, x, y, c);
    cout << "Longest Common Subsequence is: " << c[m][n] << endl;
    //*
    cout << "Matrix c is: " << endl;
    for(int i=1; i<=m; ++i){
        for(int j=1; j<=n; ++j){
            cout << c[i][j] << ' ';
        } cout << endl;
    }
    //*/
    LCS(m, n, x, c);
    return 0;
}