[LeetCode-Java]22. Generate Parentheses

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:

[
“((()))”,
“(()())”,
“(())()”,
“()(())”,
“()()()”
]

解：递归的思想，每次可以添加’（’和’）’，不满足条件退出，满足条件输出。注意边界条件，当边界条件不满足时，递归前进；当边界条件满足时，递归返回。
关于此题的边界条件，博客http://www.cnblogs.com/yuzhangcmu/p/4113563.html分析的很好。

public class Solution {
    public List<String> generateParenthesis(int n) {
        List<String> ret = new ArrayList<String>();

        if (n == 0) {
            return ret;
        }

        dfs(n, n, new StringBuilder(), ret);

        return ret;
    }

    public void dfs(int left, int right, StringBuilder sb, List<String> ret) {
        if (left == 0 && right == 0) {
            ret.add(sb.toString());
            return;
        }

        if (left < 0 || right < 0 || left > right) {
            return;
        }

        dfs(left - 1, right, sb.append('('), ret);
        sb.deleteCharAt(sb.length() - 1);

        dfs(left, right - 1, sb.append(')'), ret);
        sb.deleteCharAt(sb.length() - 1);
    }

}