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:
[
"((()))",
"(()())",
"(())()",
"()(())",
"()()()"
]
给定括号数,写一个函数,列出所有正确格式的括号组合。
Name | Name | Last commit date | ||
---|---|---|---|---|
parent directory.. | ||||
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:
[
"((()))",
"(()())",
"(())()",
"()(())",
"()()()"
]
给定括号数,写一个函数,列出所有正确格式的括号组合。