## [leetcode] Generate Parentheses

Generate Parentheses 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: “((()))”, “(()())”, “(())()”, “()(())”, “()()()” tag: backtracking 7/10/2015 udpate DFS approach, add some restrictions to guarantee the validation of parentheses class Solution { […]