leetcode-70. Climbing Stairs
2016-12-13 22:14
375 查看
leetcode-70. 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?
依然是基本的动态规划。没有什么特别需要注意的
public class Solution { public int climbStairs(int n) { int[] stairs = new int[n+1]; stairs[0] = 1; for(int i = 0 ; i < n+1 ; i++){ if(i+1<n+1) stairs[i+1]+= stairs[i]; if(i+2<n+1) stairs[i+2]+= stairs[i]; } return stairs ; } }
相关文章推荐
- [勇者闯LeetCode] 70. Climbing Stairs
- [leetcode]: 70. Climbing Stairs
- Leetcode:70. Climbing Stairs(JAVA)
- leetcode之70. Climbing Stairs(C++解法 动态规划思想)
- leetcode 70. Climbing Stairs
- LeetCode70. Climbing Stairs
- Leetcode 70. Climbing Stairs
- [leetcode] 70. Climbing Stairs
- leetcode 70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- LeetCode [DP]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
- 【leetcode】70. Climbing Stairs
- LeetCode *** 70. Climbing Stairs
- LeetCode 70. Climbing Stairs