Skip to content

Latest commit

 

History

History
13 lines (8 loc) · 269 Bytes

README.md

File metadata and controls

13 lines (8 loc) · 269 Bytes
Raw

The problem

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: ["()"]