[Leetcode 29] 70 Climbing Stairs
2013-05-20 07:31
471 查看
Probelm:
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?
Analysis:
Simplest DP problem,
Sn = Sn-1 + Sn-2 with S1 = 1 and S2 = 2;
Code:
View Code
Attention:
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?
Analysis:
Simplest DP problem,
Sn = Sn-1 + Sn-2 with S1 = 1 and S2 = 2;
Code:
class Solution { public: int climbStairs(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 1) return 1; if (n == 2) return 2; int s1=1, s2=2, s3; for (int i=2; i<n; i++) { s3 = s1 + s2; s1 = s2; s2 = s3; } return s3; } };
View Code
Attention:
相关文章推荐
- LeetCode 70 Climbing Stairs
- 【LeetCode】70 - Climbing Stairs
- [leetcode 70]Climbing Stairs
- LeetCode70 Climbing Stairs 解题报告
- Leetcode-70 Climbing Stairs
- 【LEETCODE】70-Climbing Stairs
- LeetCode70——Climbing Stairs
- Leetcode 70 Climbing Stairs 爬楼梯的方法(动态规划)
- LeetCode(70) Climbing Stairs
- LeetCode-70-Climbing Stairs-E
- LeetCode 70 Climbing Stairs (递推)
- leetcode70——Climbing Stairs
- leetcode70-Climbing Stairs(斐波那契数列)
- LeetCode70 Climbing Stairs
- 【Leetcode-Easy-70】Climbing Stairs
- leetcode 70 Climbing Stairs
- [LeetCode]70 Climbing Stairs
- [leetcode 70]Climbing Stairs
- Leetcode 70 Climbing Stairs
- LeetCode70:Climbing Stairs