摘要: n个台阶,一次可以走1步,也可以走2步,有多少种走法,给出具休的走法方案? def f(n,s=""): if n <= 0: print("0" + s) return if n == 1: print("0,1" + s) return f(n-1,"," + str(n) + s) f(n-2 阅读全文
posted @ 2021-03-08 16:43 Richardo-M-Lu 阅读(708) 评论(0) 推荐(0)