LeetCode-Climbing Stairs
来源:互联网 发布:南阳企业网站排名优化 编辑:程序博客网 时间:2024/06/11 08:38
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?
Solution:Code:
<span style="font-size:14px;">class Solution {public: int climbStairs(int n) { if (n == 1 || n == 2) return n; int first = 1, second = 2, third; for (int i = 3; i <= n; i++) { third = first+second; first = second; second = third; } return third; }};</span>
0 0
- LeetCode: Climbing Stairs
- LeetCode: Climbing Stairs
- [LeetCode]Climbing Stairs
- LeetCode Climbing Stairs
- [Leetcode] Climbing Stairs
- Leetcode: Climbing stairs
- LeetCode Climbing Stairs
- [LeetCode] Climbing Stairs
- leetcode 107: Climbing Stairs
- [LeetCode] Climbing Stairs
- [LeetCode]Climbing Stairs
- [leetcode]Climbing Stairs
- LeetCode-Climbing Stairs
- [leetcode] Climbing Stairs
- LeetCode - Climbing Stairs
- LeetCode:Climbing Stairs
- Leetcode Climbing Stairs
- LeetCode | Climbing Stairs
- C++进一步扩充和完善了C语言
- CSAPP中一个有意思的小东西
- work_weipa_返回上一页
- Eclipse Android创建项目如法正确导入.R包
- 今年在宁波奉化出海捕鱼快乐行
- LeetCode-Climbing Stairs
- Android gallery 3D效果
- SunDay天气——开放源码
- 注入FactoryBean失败分析+解决方案
- USACO - 【Odometer】中文题解
- 代码简洁之道:C++ 11 之auto+ for_each + lamda表达式
- hdu-1028-Ignatius and the Princess III
- jQuery.extend 函数详解
- MyEclipse6.5安装SVN插件