search

LeeMax117 / LeetCode_practise

recorde our Leetcode process
0 stars 1 forks source link

22. Generate Parentheses #14

Closed nijilong1224 closed 5 years ago

nijilong1224 commented 5 years ago

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:

[ "((()))", "(()())", "(())()", "()(())", "()()()" ]

nijilong1224 commented 5 years ago

https://github.com/LeeMax117/LeetCode_practise/blob/master/Jinglong/generateParenthesis.py

LeeMax117 commented 5 years ago

https://github.com/LeeMax117/LeetCode_practise/blob/master/LeeMax/22_Generate_Parentheses.py