15/100. Climbing Stairs

跳台阶，一次可以跳1节台阶或2节台阶，求跳到第n节台阶可以用多少种跳法。

n=0，res=0；
n=1，res=1；
n=2，res=2；
从n=3开始迭代，“a”表示当前站在第2节台阶（即为后退了1节台阶，也可理解为1次跳1节台阶），“b”表示当前站在第1节台阶（即为后退了2节台阶，也可理解为1次跳2节台阶）。

class Solution:def climbStairs(self, n):""":type n: int:rtype: int"""if n <= 2:return na = 1  # 后退1阶台阶b = 2  # 后退2阶台阶sum = 0for i in range(3, n+1):sum = a+ba = bb = sumreturn sum

15/100. Climbing Stairs相关推荐

算法:Climbing Stairs(爬楼梯) 6种解法
说明算法:Climbing Stairs(爬楼梯) LeetCode地址:https://leetcode.com/problems/climbing-stairs/ 题目: You are cli ...
70. Climbing Stairs
70. Climbing Stairs 1. 题目 You are climbing a stair case. It takes n steps to reach to the top. Each ...
爬楼梯 · Climbing Stairs
［抄题］: 假设你正在爬楼梯,需要n步你才能到达顶部.但每次你只能爬一步或者两步,你能有多少种不同的方法爬到楼顶部? ［思维问题］: 不知道一步.两步怎么加.还是用iteration迭代.此题公式可被 ...
【动态规划斐波那切数列】LeetCode 746. Min Cost Climbing Stairs
LeetCode 746. Min Cost Climbing Stairs 本博客转载自:http://www.cnblogs.com/grandyang/p/8343874.html 存在无代价的 ...
【斐波那切数列】LeetCode 70. Climbing Stairs
LeetCode 70. Climbing Stairs 这是一道利用斐波那切数列求解的题目.求斐波那切数列有比较经典的4种方法 (1)递归法:复杂度太高 (2)迭代法:时间复杂度为O(n)O(n)O ...
[勇者闯LeetCode] 70. Climbing Stairs
[勇者闯LeetCode] 70. Climbing Stairs Description You are climbing a stair case. It takes n steps to rea ...
10.2 动态规划算法套路及空间优化 —— Climbing Stairs Unique Paths
这一篇文章从最简单的动态规划题目开始,结合上一节动态规划三要素,以LeetCode两道基础的DP题目阐述DP问题的基本套路解法. 70. Climbing Stairs You are climbin ...
[LeetCode]70.Climbing Stairs
[题目] You are climbing a stair case. It takes n steps to reach to the top. Each time you can either c ...
【LeetCode】70 - Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...

15/100. Climbing Stairs

15/100. Climbing Stairs相关推荐

最新文章

热门文章