miin29na

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: [ "((()))", "(()())", "(())()", "()(())", "()()()" ] class Solution { public List generateParenthesis(int n) { List result = new ArrayList(); backtrack(result, "", 0 , 0, n); return result; } public void backtrack(List result, String cur, int open, ..