##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LeetCode 70
You are climbing a staircase with steps. Each time you can climb or steps. How many distinct ways can you reach the top?
For example, if , there are ways: , , .
Hint: this follows the Fibonacci sequence. If is the number of ways to reach step , then .
