70. Climbing Stairs
Description
You are climbing a staircase. It takes n
steps to reach the top.
Each time you can either climb 1
or 2
steps. In how many distinct ways can you climb to the top?
Example 1:
1 | Input: n = 2 |
Example 2:
1 | Input: n = 3 |
Constraints:
1 <= n <= 45
Hints/Notes
- 2024/12/22
- dp
- 0x3Fâs solution(checked)
Solution
Language: C++
1 | class Solution { |