Question

如何高效获取两个字符串的相同子串

Answer 1

没有试过中文处理，有一个例子希望可以作为您的起点：
public static String longestCommonSubstring(String first, String second) {
String tmp = "";
String max = "";
for (int i=0; i < first.length(); i++){
for (int j = 0; j < second.length(); j++){
for (int k = 1; (k+i) <= first.length() && (k+j) <= second.length(); k++){
if (first.substring(i, k + i).equals(second.substring(j, k + j))){
tmp = first.substring(i, k + i);
}
else{
if (tmp.length() > max.length())
max = tmp;
tmp = "";
}
}
if (tmp.length() > max.length())
max = tmp;
tmp = "";
}
}
return max;
}