隨筆檔案(496)

Java代碼實現(xiàn)

/**
* 查找兩個串的最大公共子串
*
* @param s1
* @param s2
* @return
*/
public static String commonMaxSubString(String s1, String s2) {
?? String maxstr = "";
?? String substring = "";
?? if (s1.length() > s2.length()) { // s1為兩個串中的短串;s2為長串
??? String temp = s1;
??? s1 = s2;
??? s2 = temp;
?? }
?? int len = s1.length();
?? ok: for (int i = len; i > 0; i--) {
??? for (int j = 0; j < len - i + 1; j++) {
???? substring = s1.substring(j, j + i);
???? if (s2.indexOf(substring) != -1) {
????? maxstr = substring;
????? break ok; // 只要一找到最大子串,就退出這個for循環(huán)
???? }
??? }
?? }
?? return maxstr;
}