[leetcode 70]Climbing Stairs

阿新 • • 發佈：2017-05-28

col 超時 gin pub bing n-2 consola href rgb

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?

爬臺階，你每次能夠上一層或者兩層，問上n層你共同擁有多少何種方法

f(n)=f(n-1)+f(n-2)

動規，記得保存n-1和n-2的結果，直接使用遞歸會超時

AC代碼

class Solution {
public:
int climbStairs(int n) {
int count[n+1];
count[0]=0;
count[1]=1;
count[2]=2;
if(n==1)
return 1;
if(n==2)
return 2;
for(int i=3;i<=n;++i)
count[i]=count[i-1]+count[i-2];
return count[n];
}
};

其它Leetcode題目AC代碼：https://github.com/PoughER/leetcode

[leetcode 70]Climbing Stairs

col 超時 gin pub bing n-2 consola href rgb You are climbing a stair case. It takes n steps to reach to the top. Each time you can eithe

LeetCode 70:Climbing Stairs

ria san 選擇 bst post take text 樓梯 csdn You are climbing a stair case. It takes n steps to reach to the top. Each time you can eit

[leetcode] 70. Climbing Stairs 解題報告

steps style n-2 遞歸 climb n-1 turn reac pan You are climbing a stair case. It takes n steps to reach to the top. Each time you can either

[Leetcode 70]: Climbing Stairs

div clas lis style tro tair ive script air Description: You are climbing a stair case. It takes n steps to reach to the top. Each time y

[LeetCode] 70. Climbing Stairs 爬樓梯

code pytho recursion tin ram pub time stair lee You are climbing a stair case. It takes n steps to reach to the top. Each time you can ei

[leetcode]70.Climbing Stairs

ret reac The solution 計算 not 動態規劃 man return 題目 You are climbing a stair case. It takes n steps to reach to the top. Each time you can ei

LeetCode 70. Climbing Stairs

nat step tair stair there mission not str sta 分析難度易來源 https://leetcode.com/problems/climbing-stairs/ 題目 You are climbing a stair case.

#LeetCode# 70. Climbing Stairs

https://leetcode.com/problems/climbing-stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you can e

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 1 or 2 steps. In how many distinct ways

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 1 or 2 steps. In how many distinct ways c

[leetcode]70. Climbing Stairs

備忘錄方法（自頂向下的動態規劃） public class Solution { public int climbStairs(int n) { int memo[] = new int[n + 1]; return climb_Stairs(0,

[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 1 or 2 steps. In how many distinct

動態迴歸Leetcode 70 Climbing Stairs

Leetcode 70 Climbing Stairs Problem Description：爬樓梯：一次可以爬1-2層樓梯，求出爬到最高一層的樓梯n時需要的步數。具體的題目資訊： https://leetcode.com/problems/climbing-

leetCode 70.Climbing Stairs （爬樓梯）解題思路和方法

Climbing Stairs 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

Leetcode 70. Climbing Stairs-每次能走1步或2步臺階，輸入n，求總的方法數

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 w

leetcode 70 Climbing Stairs (爬樓梯) python3 多種思路(Top down / Bottom up)

class Solution: # def __init__(self): # self.dic = {1:1, 2:2} def climbStairs(se

LeetCode 70. Climbing Stairs 爬樓梯

解法一： class Solution { public: int climbStairs(int n) { int cur=1,prev=0; for(int i=1;i<=n;++i) {

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 1 or 2 steps. In how many distinct

LeetCode-70. Climbing Stairs (Java)

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

【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 1 or 2 steps. In how many distinct wa

[leetcode 70]Climbing Stairs

相關推薦