leetcode -- 22. Generate Parentheses faster than 100%

題目描述 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: [ 「((()))」, 「(()())」, 「(())()」, 「()(())」, 「()(

>>阅读原文<<