题目详情请见:求字符串的最长公共子序列
在上题求出子序列长度基础上,我们要求出子序列本身长什么样
思路:
在求最大长度的时候,我把当前最大长度的来源记下来,用path数组保存
1:当前string1[i] == string2[j]
2:当前string[i] != string2[j],并且dp[i - 1] [j] > dp[i] [j – 1]
3:当前string[i] != string2[j],并且dp[i - 1] [j] < dp[i] [j – 1]
再利用递归方法求出具体的子字符串
/**
* 求出最长公共子序列
* @param text1
* @param text2
* @return 具体的子字符串
*/
public String longestCommonSubsequence(String text1, String text2) {
int len1 = text1.length(), len2 = text2.length();
int[][] path = new int[len1 + 1][len2 + 1];
int[][] dp = new int[len1 + 1][len2 + 1];
// 初始化
dp[0][0] = 0;
for (int i = 0; i < len1; i++) dp[i][0] = 0;
for (int i = 0; i < len2; i++) dp[0][i] = 0;
// 递推
for (int i = 1; i <= len1; i++) {
for (int j = 1; j <= len2; j++) {
if(text1.charAt(i - 1) == text2.charAt(j - 1)){
dp[i][j] = dp[i - 1][j - 1] + 1;
// path存储的值分三种情况:1->当前字符串相等,2和3类推
path[i][j] = 1;
}
else {
dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
path[i][j] = dp[i - 1][j] > dp[i][j - 1] ? 2 : 3;
}
}
}
StringBuilder stringBuilder = new StringBuilder();
return getPath(text1, len1, len2 ,path, stringBuilder);
}
/**
* 根据path找到字符串路径(递归)
* @param len1
* @param len2
* @param path
* @return 目标子字符串
*/
private String getPath(String text1, int len1, int len2, int[][] path, StringBuilder stringBuilder) {
if(len1 == 0 || len2 == 0) {
return stringBuilder.toString();
}
if(path[len1][len2] == 1){
getPath(text1, len1 - 1, len2 - 1, path, stringBuilder);
stringBuilder.append(text1.charAt(len1 - 1));
}else if(path[len1][len2] == 2){
getPath(text1, len1 - 1, len2, path, stringBuilder);
}else {
getPath(text1, len1, len2 - 1, path,stringBuilder);
}
return stringBuilder.toString();
}