题目描述:
给定一个字符串 s,将 s 分割成一些子串,使每个子串都是回文串。返回 s 所有可能的分割方案
示例:
输入: “aab”
输出:
[
["aa","b"],
["a","a","b"]
]
代码如下:
class Solution {
public List<List<String>> partition(String s) {
int len = s.length();
List<List<String>> res = new LinkedList<>();
if (len == 0) {
return res;
}
LinkedList<String> path = new LinkedList<>();
char[] ch = s.toCharArray();
dfs(ch, 0, len, path, res);
return res;
}
public void dfs(char[] charArray, int index, int len, LinkedList<String> path, List<List<String>> res) {
if (index == len) {
res.add(new LinkedList<>(path));
return;
}
for (int i = index; i < len; i++) {
if (!checkPalindrome(charArray, index, i)) {
continue;
}
path.addLast(new String(charArray, index, i + 1 - index));
dfs(charArray, i + 1, len, path, res);
path.removeLast();
}
}
public boolean checkPalindrome(char[] charArray, int left, int right) {
while (left < right) {
if (charArray[left] != charArray[right]) {
return false;
}
left++;
right--;
}
return true;
}
}
执行结果: