- You are climbing a staircase. It takes
nsteps to reach the top.
- Each time you can either climb
2steps. In how many distinct ways can you climb to the top?
- This challenge corresponds to LeetCode #70.
1 <= n <= 45
Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps
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
Below is my solution and some test cases. This solution has a linear time complexity O(n) and a linear space complexity O(n), where n is the number of steps.