LeetCode Top 100 Liked Questions 22. Generate Parentheses (Java版; Medium)
题目描述
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:
[
"((()))",
"(()())",
"(())()",
"()(())",
"()()()"
]
LeetCode Top 100 Liked Questions 22. Generate Parentheses (Java版; Medium)
welcome to my blogLeetCode Top 100 Liked Questions 22. Generate Parentheses (Java版; Medium)题目描述Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses...