carloscn / carloscn/structstudy
生成匹配的括号 (Leetcode-22)
Open
递归回溯
- Dominant language
- C
- Stars
- 4
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
### [问题描述](https://leetcode.cn/problems/generate-parentheses/):
题目描述:数字n 代表生成括号的对数,请你设计一个函数,用于能够生成所有可能的并且有效的括号组合。
示例 1:
输入:n = 3
输出:["((()))","(()())","(())()","()(())","()()()"]
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.