最长公共子串.txt

C精彩编程百例源码

#include "stdafx.h"
#include <iostream>
#include <string>
using namespace std;

int commstr(string a, string b)
{
	int i,j,max=0;
	int m=a.length(),n=b.length();

	int **d=new int*[m+1];
	  for(i=0;i<m+1;i++)
	  d[i]=new int[n+1]; 
	  
	  d[0][0]=0;
	  for(i=1;i<=m;i++)
         d[i][0]=0;
	  for(j=0;j<=n;j++)
		 d[0][j]=0;

	  for(i=1;i<=m;i++)
	  {
		  for(j=1;j<=n;j++)
		  {
			  if(a[i-1]==b[j-1])
			  {
				  d[i][j]=d[i-1][j-1]+1;
				  max=d[i][j]>max?d[i][j]:max;
			  }
		  }
	  }
return max;
for(i=0;i<=m;i++)
			  delete[] d[i];
		 delete[] d;
  

}
     
 evaluate comparability


int main(int argc, char* argv[])
{
	string a="abcd",b="xbadz";
	cout<<commstr(a,b)<<endl;;
	return 0;
}