【LeetCode】Climbing Stairs
2014-06-19 22:04
357 查看
题目描述:
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?
dp解,dp[i]=dp[i-1]+dp[i-2],当然要判定边界。
代码:
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?
dp解,dp[i]=dp[i-1]+dp[i-2],当然要判定边界。
代码:
class Solution { public: int climbStairs(int n) { vector<int> dp(n); for (int i = 0; i < n; i++){ if (!i) dp[i] = 1; if (i == 1) dp[i] = 1; if (i - 1 >= 0) dp[i] += dp[i - 1]; if (i - 2 >= 0) dp[i] += dp[i - 2]; } return dp[n - 1]; } };
相关文章推荐
- (java)leetcode-70:Climbing Stairs
- [LeetCode] Climbing Stairs
- 【LeetCode 70】Climbing Stairs(Python)
- LeetCode Climbing Stairs 爬楼梯
- 【LeetCode】70 - Climbing Stairs
- leetcode 070 —— Climbing Stairs
- [leetcode] climbing Stairs
- LeetCode——Climbing Stairs
- leetcode 70 Climbing Stairs
- Leetcode: Climbing Stairs
- 【leetcode】Climbing Stairs
- [LeetCode] [Climbing Stairs 2012-04-03]
- Leetcode算法学习日志-70 Climbing Stairs
- [C++]LeetCode: 52 Climbing Stairs
- 【LeetCode】746. Min Cost Climbing Stairs
- leetcode 70:Climbing Stairs
- LeetCode_Climbing Stairs--爬楼梯
- leetcode-Climbing Stairs
- leetcode 070 climbing stairs
- Leetcode 70 Climbing Stairs