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: [ "((()))", "(()())", "(())()
相關文章
相關標籤/搜索