首页 > itarticle > [leetcode] problem 22 – generate parentheses

[leetcode] problem 22 – generate parentheses

admin 11月 13, 2020 0

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

For example, given n = 3, a solution set is:

[
  "((()))",
  "(()())",
  "(())()",
  "()(())",
  "()()()"
]

Code

public List<String> (int n) {
    List<String> result = new ArrayList<>();

    generateParenthesisHelper(result, n, 0, 0, "");

    return result;
}

private void generateParenthesisHelper(List<String> result, int n, int open, int close, String str) {
    if (str.length() == 2 * n) {
        result.add(str);
        return;
    }

    if (close < open)
        generateParenthesisHelper(result, n, open, close + 1, str + ")");

    if (open < n)
        generateParenthesisHelper(result, n, open + 1, close, str + "(");
}