首页 > 代码库 > Climbing Stairs
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?
class Solution {
public:
int climbStairs(int n) {
int step[n];
step[0]=1;
step[1]=1;
for(int i=2;i<=n;i++)
step[i]=step[i-1]+step[i-2];
return step[n];
}
};
public:
int climbStairs(int n) {
int step[n];
step[0]=1;
step[1]=1;
for(int i=2;i<=n;i++)
step[i]=step[i-1]+step[i-2];
return step[n];
}
};
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。