leetcode-70-Climbing Stairs
2017-02-20 17:38
399 查看
问题
题目:[Climbing Stairs]思路
DP,斐波那契数列是转移方程。代码
class Solution { public: int climbStairs(int n) { if(1==n) return 1; else if(2==n) return 2; else{ int f1 = 1; int f2 = 2; for(int i = 3; i <= n; ++i){ int t = f1+f2; f1 = f2; f2 = t; } return f2; } } };
相关文章推荐
- leetcode70-Climbing Stairs
- LeetCode 70: Climbing Stairs
- 【LeetCode】C# 70、Climbing Stairs
- leetcode || 70、 Climbing Stairs
- leetcode 70-Climbing Stairs
- [LeetCode]: 70: Climbing Stairs
- leetcode[70]:Climbing Stairs
- leetcode_question_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
- LeetCode70 Climbing Stairs
- LeetCode70 Climbing Stairs
- leetcode_question_70 Climbing Stairs
- LeetCode 70:Climbing Stairs
- leetcode[70]Climbing Stairs