Files
PS/leetcode/70.py
Gyubin Han dede0dca01 leetcode
2025-02-19 14:09:55 +09:00

9 lines
178 B
Python

class Solution:
def climbStairs(self, n: int) -> int:
dp=[0,1,2]
for i in range(3,n+1):
dp.append(dp[i-2]+dp[i-1])
return dp[n]