Problem
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?
Algorithm
DP. f(n) = f(n-1) + f(n-2), like Fibonacci sequence.
Code
class Solution:
def climbStairs(self, n: int) -> int:
if not n:
return 0
dp = [0] * (n + 1)
dp[0] = 1
if n >= 1:
dp[1] = 1
for i in range(2, n+1):
dp[i] = dp[i-1] + dp[i-2]
return dp[n]