Easy · Dynamic programming
Climbing Stairs
You are climbing a staircase with n steps. Each move takes you up one step or two. Return how many different ways there are to reach the top.
- The order of the moves matters: 1 then 2 is a different way from 2 then 1.
- n is at least 1.
n = 3 → 3 (1+1+1, 1+2, 2+1)Record your take