70 Climbing Stairs – Easy¶
Problem:¶
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Thoughts:¶
Very straight forward solution.
ways[i] = ways[i-1] + ways[i-2];