题目
详解
- 一、递归
从两个字符串s1,s2的最后一个字符比起,如果相等,则最长公共子序列 = lcs(s1[0 ~ len-1], s2(0 ~ len-1)) + 1
;如果不相等,则最长公共子序列 = max(lcs(s1[0 ~ len], s2[0 ~ len - 1]), lcs(s1[0 ~ len - 1], s2[0 ~ len]))
。 - 二、动态规划
两个字符串,用二维动态规划数组,dp[i][j]表示s1的0 ~ i索引和s2的0 ~ j索引的最长公共子序列。
【转载】动态规划之最长公共子序列(LCS)
package leetcode.dp;
import java.util.Scanner;
public class LongestCommonSubsequence {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
while(s.hasNext()) {
String s1 = s.next();
String s2 = s.next();
System.out.println(longestCommonSubsequence2(s1, s2));
}
s.close();
}
public static int longestCommonSubsequence1(String text1, String text2) {
int l1 = text1.length();
int l2 = text2.length();
return longest(text1, l1-1, text2, l2-1);
}
public static int longest(String s1, int end1, String s2, int end2) {
if(end1 < 0 || end2 < 0) return 0;
if(s1.charAt(end1) == s2.charAt(end2))
return longest(s1,end1-1, s2, end2-1) + 1;
else {
return Math.max(longest(s1, end1, s2, end2-1), longest(s1,end1-1, s2, end2));
}
}
public static int longestCommonSubsequence2(String text1, String text2) {
int l1 = text1.length();
int l2 = text2.length();
int[][] dp = new int[l1 + 1][l2 + 1];
for(int i=0;i<=l1;i++) {
for(int j=0;j<=l2;j++) {
dp[i][j] = 0;
}
}
for(int i=1;i<=l1;i++) {
for(int j=1;j<=l2;j++) {
if(text1.charAt(i-1) == text2.charAt(j-1)) {
dp[i][j] = dp[i-1][j-1] + 1;
}else {
dp[i][j] = Math.max(dp[i][j-1], dp[i-1][j]);
}
}
}
return dp[l1][l2];
}
}