LeetCode-70-Climbing Stairs-E
2018-02-05 14:15
423 查看
爬台阶,爬n阶,每次1阶或2阶,求所有可能方案的数目。
动态规划:
动态规划:
int climbStairs(int n) { vector<int> steps(n); steps[0]=1; steps[1]=2; for(int i=2;i<n;i++){ steps[i]=steps[i-2]+steps[i-1]; } return steps[n-1]; }
相关文章推荐
- LeetCode70——Climbing Stairs
- leetcode 70 Climbing Stairs
- LeetCode 70 Climbing Stairs(记忆化搜索)
- 【leetcode】【70】Climbing Stairs
- LeetCode70——Climbing Stairs
- Leetcode-70: Climbing Stairs (DP, 尾递归,Memorization)
- Leetcode算法学习日志-70 Climbing Stairs
- LeetCode_70---Climbing Stairs
- [Leetcode 29] 70 Climbing Stairs
- LeetCode 70 Climbing Stairs
- LeetCode-70 climbing stairs(方法大总结)
- leetcode 70 Climbing Stairs
- Leetcode 70 Climbing Stairs 递推
- 【Leetcode-Easy-70】Climbing Stairs
- Leetcode 70 Climbing Stairs
- leetcode 70 Climbing Stairs
- leetcode 70 Climbing Stairs(难易度:Easy)
- 【LeetCode】C# 70、Climbing Stairs
- 【LeetCode】70 - Climbing Stairs
- LeetCode70 Climbing Stairs