-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathT20.java
More file actions
64 lines (53 loc) · 1.58 KB
/
T20.java
File metadata and controls
64 lines (53 loc) · 1.58 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
import java.util.ArrayList;
/**
* @author aliyang
* @date 18-5-31 下午10:44
* palindrome-partitioning：我的解法
*/
public class T20 {
public ArrayList<ArrayList<String>> partition(String s) {
if (s.length()==0||s==null)
return new ArrayList<ArrayList<String>>();
ArrayList<ArrayList<String>> res=new ArrayList<>();
ArrayList<String> current=new ArrayList<>();
part(s,res,current);
return res;
}
// 判断是否是回环字符串
private boolean isPalindrome(String s){
int start=0;
int end=s.length()-1;
while (start<end){
if (s.charAt(start)!=s.charAt(end))
return false;
start++;
end--;
}
return true;
}
private void part(String s,ArrayList<ArrayList<String>> res,ArrayList<String> cur){
if (s.equals("")){
res.add(new ArrayList<>(cur));
return;
}
for (int i=1;i<=s.length();i++){
String tmp=s.substring(0,i);
if (isPalindrome(tmp)){
cur.add(tmp);
part(s.substring(i,s.length()),res,cur);
cur.remove(cur.size()-1);
}
}
}
public static void main(String[] args){
T20 t=new T20();
String s="aab";
ArrayList<ArrayList<String>> res=t.partition(s);
for (int i=0;i<res.size();i++){
ArrayList<String> tmp=res.get(i);
for (int j=0;j<tmp.size();j++){
System.out.println(tmp.get(j));
}
}
}
}