This approach uses recursion to explore the different ways to reach the top. To optimize, we use memoization to store results of subproblems to avoid redundant calculations. This ensures that each subproblem is solved only once, dramatically improving efficiency.
Time Complexity: O(n), as each state is only computed once.
Space Complexity: O(n), due to the memoization array.
1#include <stdio.h>
2#define MAX 46
3
4int memo[MAX] = {0};
5
6int climbStairs(int n) {
7 if (n == 1) return 1;
8 if (n == 2) return 2;
9 if (memo[n] != 0) return memo[n];
10 memo[n] = climbStairs(n - 1) + climbStairs(n - 2);
11 return memo[n];
12}
13
14int main() {
15 int n = 3;
16 printf("%d", climbStairs(n));
17 return 0;
18}This C code provides a recursive solution enhanced with memoization. We define an array memo to store the results of previously solved subproblems. This helps in reducing redundant calculations, thus optimizing the recursive solution.
This approach builds from the base up using a table to store results at each step. Starting with known base cases, each subsequent result is built by combining previous results. This eliminates the recursive overhead, making it a very efficient algorithm.
Time Complexity: O(n), since each value is calculated sequentially in a loop.
Space Complexity: O(n), for storing the results in the dp array.
1function climbStairs(n) {
2 if (n <= 2) return n;
3 const dp = new Array(n + 1).fill(0);
4 dp[1] = 1;
5 dp[2] = 2;
6 for (let i = 3; i <= n; i++) {
7 dp[i] = dp[i - 1] + dp[i - 2];
8 }
9 return dp[n];
10}
11
12console.log(climbStairs(3));This JavaScript code implements a dynamic programming solution with an array dp tracking the number of ways to climb stairs. Using a simple iteration through the range, it calculates each step's solutions sequentially.