9. Climbing Stairs
EasyDynamic programming
You can climb 1 or 2 steps at a time. Return the number of distinct ways to reach the top of a staircase with n steps.
Example 1
Input: n = 2 Output: 2 Explanation: 1+1 or 2
Example 2
Input: n = 3 Output: 3 Explanation: 1+1+1, 1+2, 2+1
Constraints
1 ≤ n ≤ 45