leetcode 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:
[
“((()))”,
“(()())”,
“(())()”,
“()(())”,
“()()()”...
原创
2019-04-18 21:44:20 ·
139 阅读 ·
0 评论