[LeetCode] 70. Climbing Stairs
2016-08-01 19:24
295 查看
思路:
这题就是斐波那契数列…直接俩变量迭代结束
这题就是斐波那契数列…直接俩变量迭代结束
int climbStairs(int n) {
if (n <= 2) return n;
int prev = 1, cur = 2;
for (int i = 2; i < n; i++) {
cur += prev;
prev = cur - prev;
}
return cur;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- 70.[Leetcode]Climbing Stairs
- <LeetCode OJ> 70. Climbing Stairs
- LeetCode - 70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- Leetcode 70. Climbing Stairs
- Leetcode:70. Climbing Stairs
- [LeetCode]70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- [leetcode]70. Climbing Stairs
- LeetCode-70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- LeetCode-70. Climbing Stairs
- LeetCode -- 70. Climbing Stairs
- leetcode(20).70. Climbing Stairs
- LeetCode:70. Climbing Stairs
- leetcode-Java-70. Climbing Stairs
- LeetCode70 Climbing Stairs
- 【LeetCode】Climbing Stairs
- [LeetCode]70 Climbing Stairs
- leetcode | Climbing Stairs