思路:将短的那个串进行长度依次递减的子串与较长的串比较,好比一个滑动窗口一样,一次次比较
当只有一个最大相同字串时
public String getMaxSameString(String str1,String str2){
if(str1 != null && str2 != null){
String maxStr = (str1.length() >= str2.length())? str1 : str2;
String minStr = (str1.length() < str2.length())? str1 : str2;
int length = minStr.length();
for(int i = 0;i < length;i++){
for(int x = 0,y = length - i;y <= length;x++,y++){
String subStr = minStr.substring(x,y);
if(maxStr.contains(subStr)){
return subStr;
}
}
}
}
return null;
}
当存在多个长度相同的最大相同子串
public String[] getMaxSameStrings(String str1, String str2) {
if (str1 != null && str2 != null) {
StringBuilder str = new StringBuilder();
String maxString = (str1.length() > str2.length()) ? str1 : str2;
String minString = (str1.length() > str2.length()) ? str2 : str1;
int len = minString.length();
for (int i = 0; i < len; i++) {
for (int x = 0, y = len - i; y <= len; x++, y++) {
String subString = minString.substring(x, y);
if (maxString.contains(subString)) {
str.append(subString).append(",");
}
}
if (str.length() != 0) {
break;
}
}
return str.toString().replaceAll(",$", "").split(",");
}
return null;
}