70. Climbing Stairs
来源:互联网 发布:手机录音软件排行 编辑:程序博客网 时间:2024/06/06 05:02
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?
Note: Given n will be a positive integer.
这是一个最基础的动态规划问题
创建一个动态数组,int *r=new int[n];
r[0]=1;
r[1]=2;
......
r[k]=r[k-1]+r[k-2];
class Solution
{
public:
int climbStairs(int n)
{
if(n<=0)
return 0;
if(n==1)
return 1;
if(n==2)
return 2;
int* r=new int[n];
r[0]=1;
r[1]=2;
for(int i=2;i<n;i++)
{
r[n]=r[n-1]+r[n-2];
}
int res;
res=r[n-1];
delete []r;
return res;
}
};
- [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
- TypeError
- JavaScript基础之查找和过滤
- System.Linq和System.Linq.Expressions命名空间
- 树莓派3:Python3调用Web Service
- RocketMQ与Kafka对比
- 70. Climbing Stairs
- (*p)++和*(p++)和*p++的区别
- 本地页面之间共享消息或变量(localStorage)
- jdbc对于模糊查询like语句嵌套变量的sql语句写法
- 大型分布式网站术语分析
- Weblogic 12c集群部署
- .NET/android/java/iOS AES通用加密解密
- JavaWeb学习总结(三)——Tomcat服务器学习和使用(二)
- sql、select查询除了某一列的数据