leetcode刷题笔记-Parentheses

22. Generate Parentheses  dfs stack 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: [ "((()))",

>>阅读原文<<