Journal Archive

2022

/**
 * @param {number} n
 * @return {number}
 */
var climbStairs = function(n, memo = []) {
    if (memo[n]) return memo[n];
    if (n <= 0) return 0;
    if (n === 1) return 1;
    if (n === 2) return 2;
    
    memo[n] = climbStairs(n - 2, memo) + climbStairs(n - 1, memo)
    
    return memo[n];
};

Day 52: Solving one of LeetCode problems

70. Climbing Stairs Difficulty - 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