leetcode Generate Parentheses(Java)

题目链接：点击打开链接

类型：DFS

解法：

public class Solution {    public List<String> generateParenthesis(int n) {        List<String> res = new ArrayList<>();        dfs(res, "", n, n);                return res;            }        private void dfs(List<String> list, String sublist, int left, int right)    {    if (left > right)    return;        if (left > 0)    dfs(list, sublist+'(', left-1, right);        if (right > 0)    dfs(list, sublist+')', left, right-1);        if (left == 0 && right == 0)    {    list.add(sublist);    return ;    }    }}