几个难点:
- 切割问题可以抽象为组合问题
- 如何模拟那些切割线
- 切割问题中递归如何终止
- 在递归循环中如何截取子串
- 如何判断回文
class Solution {
List<List<String>> lists = new ArrayList<>();
Deque<String> deque = new LinkedList<>();
public List<List<String>> partition(String s) {
backtracking(s,0);
return lists;
}
private void backtracking(String s, int startIndex){
if(startIndex >= s.length()){
lists.add(new ArrayList(deque));
return;
}
for(int i = startIndex;i < s.length();i++){
if(isPalindrome(s,startIndex,i)){
String str = s.substring(startIndex,i+1);
deque.addLast(str);
}else{
continue;
}
backtracking(s,i+1);
deque.removeLast();
}
}
private boolean isPalindrome(String s, int startIndex,int end){
for(int i = startIndex, j = end ; i < j ; i++,j--){
if(s.charAt(i) != s.charAt(j)){
return false;
}
}
return true;
}
}