70.Climbing Stairs
2015-08-08 22:24
337 查看
问题:斐波那契数列问题
思路:用递归的话有很多重复计算,时间、空间不行,有可能栈溢出。用动态规划很好的解决这些问题。
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
;
delete []dp;
return res;
}
};
思路:用递归的话有很多重复计算,时间、空间不行,有可能栈溢出。用动态规划很好的解决这些问题。
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
;
delete []dp;
return res;
}
};
相关文章推荐
- INSTALL_FAILED_OLDER_SDK
- 2015 Multi-University Training Contest 6
- MapReduce作业内调度研究
- os.waitpid()无法获取sys.exit()退出时的status code
- POJ 2246 Matrix Chain Multiplication
- os.waitpid()无法获取sys.exit()退出时的status code
- HDU 1789 Doing Homework again
- RHEL6.5的RAID管理
- Paint与Canvas(形状工具本质都是调用画笔工具)
- HDOJ A + B for you again 1867【KMP】
- Problem F. Flat----(2015 summer training #5)
- Problem A. Automated Telephone Exchange----(2015 summer training #5)
- Teaching Mario to play with himself: AI, machine learning, and Super Mario Bros.
- ssh登陆提示"Host key verification failed."的解决方法
- hdoj 48119 Mosaic (二维线段树 单点更新)
- 使用GCC扩展attribute,在main函数外进行操作
- adb opendir failed,Permission denied
- HDU 1983 Kaitou Kid - The Phantom Thief (2) bfs and dfs
- [leetcode] Container With Most Water
- HDU 2473 Junk-Mail Filter(删点)