LeetCode#70 Climbing Stairs

Problem Definition:

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?

Solution: 可以用动态规划来解。令爬n级阶梯的方式有f(n)种。

　　要到达第n级阶梯，要么是从第n-1级阶梯爬一步，要么是从第n-2级阶梯爬两步（一次性）。而这两种情况是没有交集的。

　　因此得到：f(n)=f(n-1)+f(n-2) (当n>1)

　　oops...正是斐波那契数列。

1 def climbStairs(n):
2     a,b,i=[1]*3
3     while i<n:
4         a,b=b,a+b
5         i+=1
6     return b

转载于:https://www.cnblogs.com/acetseng/p/4671469.html

LeetCode#70 Climbing Stairs相关推荐

【斐波那切数列】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 ...
[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 ...
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 ...
leetcode: 70. Climbing Stairs
Problem # You are climbing a stair case. It takes n steps to reach to the top. # # Each time you can ...
70. Climbing Stairs
70. Climbing Stairs 1. 题目 You are climbing a stair case. It takes n steps to reach to the top. Each ...
leetcode python3 简单题70. Climbing Stairs
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第七十题 (1)题目英文: You are climbing a stair ca ...
【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 ...