方法一:递归方法,因为递归法时间复杂度过高,主要展示动态规划方法
方法二:动态规划
class Solution:
def numWays(self, n: int) -> int:
a,b=0,1
for i in range(n+1):
a,b=b,a+b
return a
也可将数字放在list里面,代码如下所示:
class Solution:
def fib(self, n: int) -> int:
if not n :
return 0
list1=[i for i in range(n+1)]
for i in range(2,n+1):
list1[i]=list1[i-1]+list1[i-2]
return list1[n]