Untitled

 avatar
unknown
plain_text
15 days ago
227 B
3
Indexable
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.

 

Example 1:

Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]
Example 2:

Input: n = 1
Output: ["()"]
Editor is loading...
Leave a Comment