mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
18 lines
339 B
HTML
18 lines
339 B
HTML
<p>括号。设计一种算法，打印n对括号的所有合法的（例如，开闭一一对应）组合。</p>
|
||
|
||
<p>说明：解集不能包含重复的子集。</p>
|
||
|
||
<p><strong>示例：</strong></p>
|
||
|
||
<pre>
|
||
<strong>输入：</strong>n = 3
|
||
<strong>输出：</strong>
|
||
[
|
||
"((()))",
|
||
"(()())",
|
||
"(())()",
|
||
"()(())",
|
||
"()()()"
|
||
]
|
||
</pre>
|