class Solution {
public String comString(String strA, String strB) {
char[] a = strA.toCharArray();
char[] b = strB.toCharArray();
StringBuilder common = new StringBuilder();
String preCom = "";
int i = 0, j = 0;
while (i
// 在b里找一个字符跟a[i]相同,直至找到或到头儿
while (j
j++;
}
// 回溯存档点
int index = i;
while (i
common.append(a[i]);
i++;
j++;
}
// 如果这一次找到的字符串比上一次长,更新
if (preCom.length()
preCom = common.toString();
}
common = new StringBuilder();
// 回溯
i = index + 1;
j = 0;
}
return preCom;
}
} 自己试了几个测试用例倒是过了