class Solution {
public List<List<String>> partition(String s) {
List<List<String>> list = new ArrayList<>();
for(int i = 0;i < s.length();i++){
for(int j = i;j < s.length();j++){
List<String> temp = new ArrayList<>();
String c = s.substring(i,j+1);
temp.add(c);//[a aa aab] 下一个:[a ab]
if(isHuiWen(c)){
list.add(temp);
}
}
}
System.out.println(list);
return list;
}
public boolean isHuiWen(String s){
int i = 0;
int j = s.length() - 1;
while(i < j){
if(s.charAt(i) == s.charAt(j)){
i++;
j--;
}else{
return false;
}
}
return true;
}
}