70.Climbing Stairs
来源:互联网 发布:微信淘宝客话术 编辑:程序博客网 时间:2024/03/28 20:47
问题:斐波那契数列问题
思路:用递归的话有很多重复计算,时间、空间不行,有可能栈溢出。用动态规划很好的解决这些问题。
class Solution {
public:int climbStairs(int n) {
int* dp=new int[n+1];
dp[1]=1;
dp[2]=2;
for(int i=3;i<=n;i++){
dp[i]=dp[i-1]+dp[i-2];
}
int res=dp[n];
delete []dp;
return res;
}
};
0 0
- [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
- 70. Climbing Stairs
- 70. Climbing Stairs
- [LeetCode]70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- 70. Climbing Stairs
- 腾讯公司最近举办活动吗
- dave3,UpdateSiteDAVEApps_1_0_66 ,dave4_v4.0.0 ,dave_v4.1.2 软件安装资源汇总
- UE4学习笔记20th
- 执行了的程序,才是你的程序.
- 网页飘浮广告
- 70.Climbing Stairs
- 工作总结
- C语言的基础复习——scanf使用注意
- 常见的HTTP状态码(HTTP Status Code)说明
- 使用Filter过滤器,控制不能直接访问JSP文件
- Linux中vi文件保存退出命令“:wq"和":x”的区别
- 【数论】hdu3944 DP?
- iOS程序启动原理
- IOS App跳转至系统Settings