70. Climbing Stairs
来源:互联网 发布:oracle 创建同义词sql 编辑:程序博客网 时间:2024/06/15 17:23
题目:
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.
思路:先对到达的前一步进行讨论,前一个跨了一个台阶或前一步跨了两个台阶。所以最后的方法数等于走n-1台阶的方法数和等于n-2台阶数的方法数之和,所以想到用递归。(但是由于是尾递归,所以也可以用循环来替换。)代码:
class Solution {
public:
int climbStairs(int n) {
if(n == 1 || n == 2)
{
return n;
}
if(n<=0)
{
return 0;
}
else
{
return climbStairs(n-1) + climbStairs(n-2);
}
}
};
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
- 【笔记】关于批量操作的取值和传值及全选反选
- 写给大数据开发初学者的话
- 让Markdown写作更简单,免费极简编辑器:Typora
- 20170425简单递归
- 3127 递归基础之爬楼梯
- 70. Climbing Stairs
- BZOJ 3207 花神的嘲讽计划Ⅰ
- Java Day01-2
- 564. Find the Closest Palindrome (Hard)
- ASP.NET Lambda去重方法
- 运维不仅仅是懂Linux就行,还需要知道这些……
- CSS在线字库
- Protobuf3 系列二 定义复杂的proto文件
- php的system函数输出信息