Climbing Stairs问题

难度级别：Easy

1.题目描述

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:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

2.思路描述

可以理解为Fibonacci数列问题：

1.当n为0时，Step(0)=1

2.当n为1时，Step(1)=1

3.当n为2时，Step(2) = Step(0) + Step(1)

.............................................................................................