Dynamic Programming:70. Climbing Stairs
来源:互联网 发布:网络之复仇剑士下载 编辑:程序博客网 时间:2024/05/22 11:38
我发现我就完全没弄懂动态规划是什么。一开始我的代码是这样的:
class Solution {public: int climbStairs(int n) { if(n == 1) return 1; if(n == 2) return 2; return climbStairs(n - 1) + climbStairs(n - 2); }};这样和暴力没有任何区别,根本没有动态规划。看了别人的思路之后写的:
class Solution {public: int climbStairs(int n) { vector<int> dictways(n + 1); dictways[0] = 0; dictways[1] = 1; dictways[2] = 2; for(int i = 3; i <= n; ++i) { dictways[i] = dictways[i - 1] + dictways[i - 2]; } return dictways[n]; }};这样才是动态规划,把每个位置的答案存下来,这个题类似斐波那契数列。
阅读全文
0 0
- 70. Climbing Stairs dynamic programming
- Dynamic Programming:70. Climbing Stairs
- LeetCode /Dynamic Programming/Climbing Stairs
- LeetCode - Fibonacci Sequence/Dynamic Programming - Climbing Stairs
- [week 10][Leetcode][Dynamic Programming] Climbing Stairs
- [LeetCode]70.Climbing Stairs
- 70.Climbing Stairs
- LeetCode --- 70. Climbing Stairs
- [Leetcode] 70. Climbing Stairs
- [leetcode] 70.Climbing Stairs
- 70.Climbing Stairs
- 70. Climbing Stairs
- 70.Climbing Stairs
- 70. Climbing Stairs
- [leetCode]70. Climbing Stairs
- 70. Climbing Stairs
- 70. Climbing Stairs LeetCode
- 70. Climbing Stairs
- 面经笔经01_交替上浮下沉冒泡排序
- wincc
- POJ开餐馆
- JavaWeb中Tomcat的相关配置以及配置任意目录下的Web应用
- 4. Median of Two Sorted Arrays
- Dynamic Programming:70. Climbing Stairs
- 第4周项目3(2)
- 有关于python学习过程中实用的网站
- centos编译安装PHP7
- Java当前时间
- Gradle整合jetty的第一个HelloWorld工程
- Webservice03---dtd与Schema
- subsets
- ElasticSearch的分布式安装