动态归划保存前面的查找结果
int[][] dp = new int[i][j]; dp[i][j] 表示a 的前i个字符与b 的前j 个字符最长的公共字符串。
状态转移方程
if(a.charAt(i - 1) == b.charAt(j - 1)) {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
import java.util.Scanner; import java.util.Arrays; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); // 注意 hasNext 和 hasNextLine 的区别 while (in.hasNextLine()) { // 注意 while 处理多个 case String a = in.nextLine(); String b = in.nextLine(); System.out.println(findLogerStr(a, b)); } } public static String findLogerStr(String str1, String str2) { String longStr = null; String shortStr = null; if (str1.length() > str2.length()) { longStr = str1; shortStr = str2; } else { longStr = str2; shortStr = str1; } int[][] dp = new int[shortStr.length() + 1][longStr.length() + 1]; //Arrays.fill(dp, 0); int max = 0; int index = 0; for (int i = 1; i <= shortStr.length(); i++) { for(int j = 1; j <= longStr.length(); j++) { if (longStr.charAt(j - 1) == shortStr.charAt(i - 1)) { dp[i][j] = dp[i - 1][j - 1] + 1; if (max < dp[i][j]) { max = dp[i][j]; index = i; } } } } return shortStr.substring(index - max, index); } }