class Solution:
def climbStairs(self, n: int) -> int:
dp = [0] * (n+1)
dp[0],dp[1] = 1,1
for i in range(2,n+1):
dp[i] = dp[i-1] + dp[i-2]
return dp[n]
70. 爬楼梯
最新推荐文章于 2024-07-15 22:10:26 发布