题目原文:
Given a string s, partition s such that every substring of the partition is a palindrome.
Return all possible palindrome partitioning of s.
For example, given s = “aab”,
Return
[
[“aa”,”b”],
[“a”,”a”,”b”]
]
题目大意:
返回字符串s的所有回文子串的分割。
题目分析:
使用backtrack(List<List<String>> list, List<String> sublist, String s)
维护搜索过程,每次从s的开头开始截取字符串,每次判断一下是否为回文串,如果是就放入sublist,然后去掉加入sublist的部分继续向下搜索,直到s为空。
源码:(language:java)
public class Solution {
public List<List<String>> partition(String s) {
List<List<String>> list = new ArrayList<List<String>>();
backtrack(list,new ArrayList<>(),s);
return list;
}
private void backtrack(List<List<String>> list, List<String> sublist, String s) {
if(s.length() == 0) {
list.add(new ArrayList<String>(sublist));
}
else {
for(int i = 1; i<=s.length();i++) {
if(isPalindrome(s.substring(0, i))) {
sublist.add(s.substring(0, i));
backtrack(list, sublist, s.substring(i));
sublist.remove(sublist.size()-1);
}
}
}
}
public boolean isPalindrome(String s) {
if(s==null||s.length()==0)
return true;
for(int i = 0,j = s.length()-1;i<j;i++,j--) {
if(s.charAt(i)!=s.charAt(j))
return false;
}
return true;
}
}
成绩:
8ms,beats 31.90%,众数8ms,29.29%