难度级别: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)
......................................................................................................................................................................................................
Step(n) = Step(n-1) + Step(n-2)
第n个阶梯,可以从第n个阶梯直接迈上去,也可以从第n-1个阶梯两步并作一步迈上去。
3.代码描述
class Solution(object):
def climbStairs(self, n):
"""
:type n: int
:rtype: int
"""
if n <= 1:
return 1
else:
a,b = 1,1
for i in xrange(n-1) :
c = a + b
a,b = b,c
return c