摘要:
1.递归方法://最大子串的递归解法#include<iostream>#include<cstring>#include<cstdio>usingnamespacestd;intmax(inta,intb){returna>b?a:b;}intlcs(char*a,char*b,inti,intj){if(i==0||j==0)return0;if(*(a+i-1)==*(b+j-1))returnlcs(a,b,i-1,j-1)+1;elsereturnmax(lcs(a,b,i-1,j),lcs(a,b,i,j-1));}intmain(){ch 阅读全文
posted @ 2011-05-04 09:47
Avril
阅读(279)
评论(0)
推荐(0)

浙公网安备 33010602011771号