LeetCode_Medium_22. Generate Parentheses

2019.1.31 题目描述: 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: [ "((()))", "(()())", "(())()
相关文章
相关标签/搜索