Source: Climbing Stairs - LeetCode
状态转移方程
f ( n ) = f ( n − 1 ) + f ( n − 2 ) f(n) = f(n-1) + f(n-2) f(n)=f(n−1)+f(n−2)
题解
class Solution:
def climbStairs(self, n: int) -> int:
if n<3:return n
DP=[i+1 for i in range(n)]
for i in range(2,n):
DP[i]=DP[i-1]+DP[i-2]
return DP[-1]