题目内容
https://leetcode-cn.com/problems/climbing-stairs/
You are climbing a stair case. It takes nsteps 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
假设你正在爬楼梯。需要 n 阶你才能到达楼顶。
每次你可以爬 1 或 2 个台阶。你有多少种不同的方法可以爬到楼顶呢?
注意:给定 n 是一个正整数。
题目思路
这道题目依旧是使用动态规划。因为可以走1步或者2步,所以对于n个台阶的情况,可以有n-1一步到n,或者从n-2两步到n
程序代码
class Solution(object):
def climbStairs(self, n):
"""
:type n: int
:rtype: int
"""
if n==0:
return 0
step={1:1,2:2}
for i in range(1,n+1):
if i not in step:
step[i]=step[i-1]+step[i-2]
return step[n]