最长公共字串-动态规划
import java.util.*;
public class ll {
static int N=256;
static int f(String s1,String s2){
int a[][]=new int[N][N];
int len1=s1.length();
int len2=s2.length();
// int i,j;
int max=0;
for (int i = 1; i <=len1 ; i++) {
for (int l = 1; l <=len2 ; l++) {
if (s1.charAt(i-1)==s2.charAt(l-1)){
a[i][l]=a[i-1][l-1]+1;
if (a[i][l]>max) max=a[i][l];
}
}
}
return max;
}
public static void main(String[] args) {
System.out.println(f("abefecd","becd"));
}
}
还没有评论,来说两句吧...