LeetCode 0070 - Climbing Stairs
Contents
Climbing Stairs
Desicription
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?
Note: Given n will be a positive integer.
Example 1:
1 | Input: 2 |
Example 2:
1 | Input: 3 |
Solution
1 | class Solution { |