LeetCode 70: Climbing Stairs
2018-04-09 19:44
447 查看
Climbing Stairs
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?
解题思路
class Solution { public: int climbStairs(int n) { if (n <= 2) return n; vector<int> dp(n, 0); dp[0] = 1; dp[1] = 2; for (int i = 2; i < n; ++i) { dp[i] = dp[i-1] + dp[i-2]; } return dp[n-1]; } };
相关文章推荐
- LeetCode-70-Climbing Stairs
- 【leetcode c++】70 Climbing Stairs
- leetcode70- Climbing Stairs
- leetcode(70). Climbing Stairs
- 【leetcode】【70】Climbing Stairs
- LeetCode-70-Climbing Stairs
- [leetcode 70] Climbing Stairs
- leetcode 70 Climbing Stairs(难易度:Easy)
- [Leetcode 29] 70 Climbing Stairs
- LeetCode 70 Climbing Stairs(爬楼梯)(动态规划)(*)
- 【LeetCode】70 - Climbing Stairs
- LeetCode(70) Climbing Stairs
- (java)leetcode-70:Climbing Stairs
- leetcode 70: Climbing Stairs
- LeetCode 70 Climbing Stairs--Python实现
- LeetCode70 Climbing Stairs
- LeetCode70 Climbing Stairs 解题报告
- LeetCode70 Climbing Stairs
- LeetCode 70 Climbing Stairs
- Leetcode 70 Climbing Stairs 递推