Climbing Stairs
Examples
Example 1:
Input: n = 2
Output: 2
Explanation:
Example 2:
Input: n = 3
Output: 3
Explanation:
1-D Dynamic Programming
Example 1:
Input: n = 2
Output: 2
Explanation:
Example 2:
Input: n = 3
Output: 3
Explanation:
You are given an integer n representing the number of steps to reach the top of a staircase. You can climb with either 1 or 2 steps at a time.
Return the number of distinct ways to climb to the top of the staircase.
1 + 1 = 22 = 21 + 1 + 1 = 31 + 2 = 32 + 1 = 31 <= n <= 30