Climbing Stairs
Easy
LC #70
fibonacci1d dpNot attempted yet
You're climbing a staircase with n steps. Each move
climbs either 1 or 2 steps. Return the number of
distinct ways to reach the top.
Example 1
Input: n = 2
Output: 2
1+1 or 2
Example 2
Input: n = 3
Output: 3
1+1+1, 1+2 or 2+1
Example 3
Input: n = 5
Output: 8
Constraints
- 1 ≤ n ≤ 45