@pythonYou 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
思路:跟斐波那契数列是一样的,属于动态规划问题,从第三个数开始,每次都是前两种情况的和,所以加前两种情况。
class Solution(object):
def climbStairs(self, n):
"""
:type n: int
:rtype: int
"""
if n == 1: return 1
if n == 2: return 2
res = [None for _ in range(n)]
res[0]=1
res[1]=2
for i in range(2,n):
res[i]=res[i-1]+res[i-2]
return res[n-1]