class Solution {
List<String> res = new ArrayList<>();
public List<String> generateParenthesis(int n) {
dfs(n,0, 0, new String());
return res;
}
public void dfs(int n, int l, int r, String s) {
if (l == n && r == n) {
res.add(s);
return;
}
if (l < n) dfs(n,l + 1, r, s + '(');
if (r < n && l > r) dfs(n, l, r + 1, s + ')');
}
}