forked from yubinbai/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
32 lines (32 loc) · 822 Bytes
/
Solution.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
import java.util.*;
public class Solution {
ArrayList<String> ret;
char[] arr;
int n;
public List<String> generateParenthesis(int n) {
ret = new ArrayList<String>();
this.n = n;
arr = new char[2 * n];
solve(0, 0);
return ret;
}
private void solve(int left, int right) {
if (right == n) {
ret.add(new String(arr));
}
if (right < left) {
arr[left + right] = ')';
solve(left, right + 1);
}
if (left < n) {
arr[left + right] = '(';
solve(left + 1, right);
}
}
public static void main(String[] args) {
Solution s = new Solution();
for (String str : s.generateParenthesis(3)) {
System.out.println(str);
}
}
}