最长公共子序列

package test;

public class LCSequence {

//求解str1 和 str2 的最长公共子序列
public static int LCS(String str1, String str2){
int[][] c = new int[str1.length() + 1][str2.length() + 1];



for(int i = 1; i <= str1.length(); i++)
for(int j = 1; j <= str2.length(); j++)
{
if(str1.charAt(i-1) == str2.charAt(j-1))
c[i][j] = c[i-1][j-1] + 1;
else if(c[i][j-1] > c[i-1][j])
c[i][j] = c[i][j-1];
else
c[i][j] = c[i-1][j];
}
return c[str1.length()][str2.length()];
}

//test
public static void main(String[] args) {
String str1 = "ABC";
String str2 = "ABCA";
int result = LCS(str1, str2);
System.out.println(result);
}
}

 

转载于:https://www.cnblogs.com/watchfluture/p/10360984.html