求序列1和序列2的最长公共子序列-基于动态规划方法

#include <cstdlib>
#include <iostream>
#include <cstring>

using namespace std;

class maxlen_string
{
 public:
   void string_();
   void LCSLength(int,int,char*,char*,int**,int**);
   void LCS(int,int,char*,int**);
   ~maxlen_string(){}
}; 



void maxlen_string::LCSLength(int m,int n,char* x,char* y,int**c,int**b)
{
  int i,j;
  for(i=1;i<=m;i++) c[i][0]=0;
  for(i=1;i<=n;i++) c[0][i]=0;
  for(i=1;i<=m;i++)
   for(j=1;j<=n;j++)
   {
    if(x[i]==y[j]) {c[i][j]=c[i-1][j-1]+1;b[i][j]=1;}
    else if(c[i-1][j]>=c[i][j-1]) {c[i][j]=c[i-1][j];b[i][j]=2;}
        else  {c[i][j]=c[i][j-1];b[i][j]=3;}                 
   }       
} 

void maxlen_string::LCS(int i,int j,char* x,int**b)
{
  if(i==0||j==0) return;
  if(b[i][j]==1) {LCS(i-1,j-1,x,b);std::cout<<x[i];}
    else if(b[i][j]==2) LCS(i-1,j,x,b);
       else LCS(i,j-1,x,b);
}

void maxlen_string::string_()
{
   char x[1000],y[1000];
    char*x_=x;char*y_=y;
    x_++;y_++;
    x[0]='a';y[0]='b';
    
    cout<<"Please input sting 1:"<<std::endl;
    cin>>x_;
    cout<<"Please input sting 2:"<<std::endl;
    cin>>y_;
    int m=strlen(x);
    int n=strlen(y);
    int**c;int**b;
    c=new int*[m+1];b=new int*[m+1];
    for(int i=0;i<=m;++i) 
        { c[i]=new int[n+1];b[i]=new int[n+1];}
    LCSLength(m,n,x,y,c,b);
      cout<<"the max length of commen substring is:"<<endl;  
    LCS(m,n,x,b);
}


int main(int argc, char *argv[])
{
    maxlen_string aa;
    aa.string_();
    system("PAUSE");
    return EXIT_SUCCESS;
}

example：