leetcode 22 Generate Parentheses 详细解答
回溯法,代码如下:
在这里,拿 n = 2来举例
f ( 2 , 2 , " " ) f(2,2,"") f(2,2,"")
|— f ( 1 , 2 , " ( " ) f(1, 2,"(") f(1,2,"(")
|— f ( 0 , 2 , " ( ( " ) f(0, 2,"((") f(0,2,"((")
|—— f ( 0 , 1 , " ( ( ) " ) f(0, 1,"(()") f(0,1,"(()")
|—— f ( 0 , 0 , " ( ( ) ) " ) f(0, 0,"(())") f(0,0,"(())") #将括号插入到列表
|— f ( 1 , 1 , " ( ) " ) f(1, 1,"()") f(1,1,"()")
|—— f ( 0 , 1 , " ( ) ( " ) f(0, 1,"()(") f(0,1,"()(")
|—— f ( 0 , 0 , " ( ) ( ) " ) f(0, 0,"()()") f(0,0,"()()")#将括号插入到列表
|—— f ( 1 , 0 , " ( ) ) " ) f(1, 0,"())") f(1,0,"())")n # left > right,返回
|— f ( 2 , 1 , " ( " ) f(2, 1,"(") f(2,1,"(") # left > right,返回
解法2
从观察得出:
当 n = 1 n = 1 n=1时, [ " ( ) " ] ["()"] ["()"]
当 n = 2 n = 2 n=2时, [ " ( ( ) ) " , " ( ) ( ) " ] ["(())","()()"] ["(())","()()"]
当 n = 3 n = 3 n=3时,就是让 " ( ) " "()" "()" 插入到 n = 2 n = 2 n=2时的每个位置。但是会出现重复的。
所以最后的代码如下: