LeetCode 22 括号生成 （Java， DP + Set)

给出 n 代表生成括号的对数，请你写出一个函数，使其能够生成所有可能的并且有效的括号组合。

例如，给出 n = 3，生成结果为：

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

class Solution {
    public List<String> generateParenthesis(int n) {
        List<String> brackets = new ArrayList<String>();
        Set<String> hs = new HashSet<String>();
        if(n == 0){
            return brackets;
        }else if(n == 1){
            brackets.add("()");
            return brackets;
        }else{
            List<String> pre = generateParenthesis(n-1);
            for(int i=0; i<pre.size(); i++){
                String current_bracket = pre.get(i);
                current_bracket = current_bracket + ")";
                for(int j=0; j < current_bracket.length(); j++){
                    if(current_bracket.charAt(j) == ')'){
                        String recent = current_bracket;
                        StringBuffer sb = new StringBuffer(recent);
                        sb.insert(j, "(");
                        hs.add(sb.toString());
                    }
                }
            }
            for(String str : hs){
                brackets.add(str);
            }
            return brackets;
        }
    }
}