Climbing Stairs
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?
climbStairs(2); // 2
climbStairs(3); // 3You 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?
climbStairs(2); // 2
climbStairs(3); // 3Run your code to see results.
Stuck? This challenge exercises: