Skip to content

Latest commit

 

History

History
59 lines (30 loc) · 582 Bytes

File metadata and controls

59 lines (30 loc) · 582 Bytes

中文文档

Description

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:

[

  "((()))",

  "(()())",

  "(())()",

  "()(())",

  "()()()"

]

Solutions

Python3

Java

...