LeetCode Solution, Easy, 70. Climbing Stairs

70. Climbing Stairs 題目敘述 You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two wa...