70. Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Note: Given n will be a positive integer.·
class Solution:
def climbStairs(self, n: int) -> int:
f = [1, 2]
for i in range(2, n):
f.append(f[i-1] + f[i-2])
return f[n-1]