摘要：
Generate ParenthesesGivennpairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, givenn= 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()()()"找出配对括号的所有组合，组合数就是卡特朗数，只是这里还要求组合，递归实现，关键 阅读全文
