LeetCode刷题笔记 022. python回溯法数字n 代表生成括号的对数,请...
class Solution: def generateParenthesis(self, n: 'int') - 'List[str]': self.res = self.dfs( , 0, 0, n) return self.res def dfs(self, s, left, right, n): if left == n and right == n: self.res.append(s) if l...