leetcode 22 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:

"((()))", "(()())", "(())()", "()(())", "()()()"

 直接DFS就好。。

class Solution:
    def dfs(self,s,left):
        if len(s)==self.num*2:
            self.ans.append(s)
            return
        if left<self.num:
            self.dfs(s+"(",left+1)
        if len(s)-left<left:
            self.dfs(s+")",left)

    # @param an integer
    # @return a list of string
    def generateParenthesis(self, n):
        self.num=n
        self.ans=[]
        self.dfs("",0)
        return self.ans