Leetcode: Climbing stairs
There is a given number of stairs
n. Stairs can be either taken two steps at a time or one step at a time. For a height of
1, there is only one possible solution:
1. For a height of
2, there are two solutions:
The main trick in this task is to discover that this is a fibonacci-like sequence. Every next step depends on the steps before. Once this is discovered, the code is straightforward. First, cover the base cases,
2. For the rest, append the sum of the first digits to a list and then pop the first element off the beginning. Finally, return the last digit.
Runtime: 41 ms, faster than 66.93% of Python3 online submissions for Climbing Stairs.
Memory Usage: 13.9 MB, less than 11.90% of Python3 online submissions for Climbing Stairs.