cpp-flashcards/org/study_deck_02/dsa/1-d-dynamic-programming/0070-climbing-stairs.org

• 0070. Climbing Stairs
  • Approach
  • Python
  • C++

TODO 0070. Climbing Stairs   easy

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

TODO Approach

Write your approach here.

TODO Python

class Solution:
    def climbStairs(self, n: int) -> int:

TODO C++

class Solution {
public:
    int climbStairs(int n) {
        
    }
};