[Leetcode] 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 can you climb to the top?

DP启蒙啊，做完这题终于对DP有个大概的认识了，自底向上检表，建完也就ok了，复杂度是O(n)

void iter(int acc, int n, vector<int> &table) {if (acc < 0) return;if (acc == n+1) return;int a = acc-1 < 0? 0 : acc-1;int b = acc-2 <0? 0 : acc-2;table.push_back(table[a] + table[b]);iter(acc+1, n, table);
}int climbStairs(int n) {vector<int> table;table.push_back(0);table.push_back(1);table.push_back(2);if (n < 3) return table[n];iter(3, n,table);return table[n];
}

另附纯递归版，当然是TLE的

int climbstairs_TLE(int n) {if (n == 1) return 1;if (n == 2) return 2;return climbstairs_TLE(n-1) + climbstairs_TLE(n-2);
}

TLE

转载于:https://www.cnblogs.com/agentgamer/p/4052988.html

[Leetcode] Climbing Stairs相关推荐

LeetCode Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...
LeetCode Climbing Stairs
You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb ...
LeetCode | Climbing Stairs
题目: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either cl ...
【动态规划斐波那切数列】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 ...
[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 ...
算法:Climbing Stairs(爬楼梯) 6种解法
说明算法:Climbing Stairs(爬楼梯) LeetCode地址:https://leetcode.com/problems/climbing-stairs/ 题目: You are cli ...
10.2 动态规划算法套路及空间优化 —— Climbing Stairs Unique Paths
这一篇文章从最简单的动态规划题目开始,结合上一节动态规划三要素,以LeetCode两道基础的DP题目阐述DP问题的基本套路解法. 70. Climbing Stairs You are climbin ...
70. Climbing Stairs
70. Climbing Stairs 1. 题目 You are climbing a stair case. It takes n steps to reach to the top. Each ...

[Leetcode] Climbing Stairs

[Leetcode] Climbing Stairs相关推荐

最新文章

热门文章