最長公共子串行

//狀態轉移方程:

//f[i][j] = f[i-1][j-1]+1 if i == 0 || j == 0
//f[i][j] = f[i-1][j-1]+1 if str[i] == str[j]
//f[i][j] = max(f[i-1][j],f[i][j-1]) if str[i] != str[j]
#include using namespace std;
int max(int a, int b) 
int lcs(char* s1,int len1,char* s2,int len2)
for(i = 1 ; i<=len1;i++)
for(int j=1;j<=len2;j++)
else
temp[i][j] = max(temp[i][j-1],temp[i-1][j]);
} int ret = temp[len1][len2];
for(i=0;i<=len1;i++) 
delete temp;
return ret;
}int main(){
char s1 = "abcfg";
char s2 = "abcdefggg";
cout