##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
LC 70 Fibonacci disguise
Let me introduce you to LeetCode , Climbing Stairs. You're climbing a staircase with steps. Each time you can climb or steps. How many distinct ways can you reach the top? Feel free to read the problem, think about it a little bit, and then move on to the next unit!
For : you can take , , , , or steps. That is distinct ways to reach the top.