实现了一个动规的最长公共字串,晚上补上带纪录最长字串记录的算法。另外再补上一个递归的算法。
代码:
public class LongestCommonSub {
public static void main(String[] args) {
int [][]res = new LongestCommonSub().lonestCommonSub("tofooodie", "toooday");
int max = new LongestCommonSub().Max(res);
System.out.println(max);
// System.out.println(new LongestCommonSub().recursiveCommonLongestsSub("tofoodie", "tooday"));
}
//不带 最长记录的
public int [][] lonestCommonSub( String str1, String str2){
int [][] res = new int [str1.length()][str2.length()];
//初始化第一行,第一列
for( int i=0;i<str1.length();i++){
if(str1.charAt(i) == str2.charAt(0)){
res[i][0] = 1;
}
}
for( int i=0;i<str2.length();i++){
if(str1.charAt(0) == str2.charAt(i)){
res[0][i] = 1;
}
}
for( int i = 1 ;i< str1.length();i++){
for(int j = 1; j< str2.length();j++){
if( str1.charAt(i) == str2.charAt(j)){
res[i][j] = res[i-1][j-1]+1;
}
// else{
// int max = res[i-1][j];
// if(res[i][j-1] > max){
// max = res[i][j-1];
// }
// res[i][j] = max;
//
// }
}
}
//print array
for( int i=0;i< res.length;i++){
for( int j =0; j< res[0].length ; j++){
System.out.print(res[i][j]+" ");
}
System.out.println();
}
return res;
}
public int Max(int [][] array){
int max = 0;
for(int i = 0;i<array.length;i++){
for(int j = 0;j<array[0].length;j++){
if(array[i][j]> max){
max = array[i][j];
}
}
}
return max;
}
}