-
Notifications
You must be signed in to change notification settings - Fork 2
/
PalindromePartitioning.java
38 lines (36 loc) · 1.08 KB
/
PalindromePartitioning.java
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
public class Solution {
public List<List<String>> result = new ArrayList<List<String>>();
public List<List<String>> partition(String s) {
if (s.length() == 0) {
return this.result;
}
List<String> curr = new ArrayList<String>();
this.dfs(curr, s);
return this.result;
}
public void dfs(List<String> curr, String s) {
if (s.length() == 0) {
this.result.add(curr);
return;
}
for (int i = 0; i < s.length(); i++) {
if (this.check(s.substring(0, i+1)) == true) {
List<String> copy = new ArrayList<String>(curr);
copy.add(s.substring(0, i+1));
this.dfs(copy, s.substring(i+1, s.length()));
}
}
}
public boolean check(String s) {
int left = 0;
int right = s.length() - 1;
while (left < right) {
if (s.charAt(left) != s.charAt(right)) {
return false;
}
left ++;
right --;
}
return true;
}
}