| English | 简体中文 |

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:

Input: n = 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: n = 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

Constraints:

• 1 <= n <= 45

Related Topics

• Memoization
• Math
• Dynamic Programming

Similar Questions

• Min Cost Climbing Stairs
• Fibonacci Number
• N-th Tribonacci Number
• Minimum Rounds to Complete All Tasks
• Count Number of Ways to Place Houses
• Number of Ways to Reach a Position After Exactly k Steps
• Count Ways To Build Good Strings
• Frog Jump II
• Find Number of Ways to Reach the K-th Stair
• The Number of Ways to Make the Sum