题目描述:
思路:最基本的做法:暴力枚举。枚举每一对字符串的组合,暴力判断它们是否能够构成回文串即可。但是时间复杂度为O(n ^2×m)。深入分析可以降低时间复杂度。如果A+B是回文,则可以分为三种情况:1. A翻转=B 2. A前半部分翻转=B,A后半部分为回文串 3. B后半部分翻转=A,B前半部分为回文串。用哈希表存储各个单词的翻转,而后每个字符是否其所需部分是否存在。
带上官方代码:
class Solution {
List<String> wordsRev = new ArrayList<String>();
HashMap<String, Integer> indices = new HashMap<String, Integer>();
public List<List<Integer>> palindromePairs(String[] words) {
int n = words.length;
for (String word: words) {
wordsRev.add(new StringBuffer(word).reverse().toString());
}
for (int i = 0; i < n; ++i) {
indices.put(wordsRev.get(i), i);
}
List<List<Integer>> ret = new ArrayList<List<Integer>>();
for (int i = 0; i < n; i++) {
String word = words[i];
int m = words[i].length();
if (m == 0) {
continue;
}
for (int j = 0; j <= m; j++) {
if (isPalindrome(word, j, m - 1)) {
int leftId = findWord(word, 0, j - 1);
if (leftId != -1 && leftId != i) {
ret.add(Arrays.asList(i, leftId));
}
}
if (j != 0 && isPalindrome(word, 0, j - 1)) {
int rightId = findWord(word, j, m - 1);
if (rightId != -1 && rightId != i) {
ret.add(Arrays.asList(rightId, i));
}
}
}
}
return ret;
}
public boolean isPalindrome(String s, int left, int right) {
int len = right - left + 1;
for (int i = 0; i < len / 2; i++) {
if (s.charAt(left + i) != s.charAt(right - i)) {
return false;
}
}
return true;
}
public int findWord(String s, int left, int right) {
return indices.getOrDefault(s.substring(left, right + 1), -1);
}
}