LeetCode——Climbing Stairs
来源：互联网 发布：网络推广 photoshop 编辑：程序博客网 时间：2024/06/09 05:13
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?
Java代码：public class Solution { public int climbStairs(int n) { if(n==1)return 1; else if(n==2)return 2; int sum = n; int []sum_ways = new int[sum]; sum_ways[0]=1; sum_ways[1]=2; for(int i=2;i<sum;i++) sum_ways[i] = sum_ways[i-1] + sum_ways[i-2]; return sum_ways[sum -1]; }}
0 0
- LeetCode——Climbing Stairs
- LeetCode——Climbing Stairs
- LeetCode——Climbing Stairs
- leetcode——Climbing Stairs
- LeetCode——Climbing Stairs
- Python学习——leetcode(Climbing Stairs)
- leetcode 070 —— Climbing Stairs
- LeetCode —— 70. Climbing Stairs
- leetcode——70——Climbing Stairs
- leetcode由易入难——【3】Climbing Stairs
- LeetCode学习篇十九——Climbing Stairs
- leetcode刷题之旅——70. Climbing Stairs
- LeetCode 70. Climbing Stairs 题解 —— Java
- LeetCode 70 — Climbing Stairs（C++ Java Python）
- LeetCode70——Climbing Stairs
- LeetCode70——Climbing Stairs
- DP——Climbing Stairs
- Algorithms—70.Climbing Stairs
- Java基础——网络编程
- 最全的Webshell提权方法总结
- js中判断一个radio按钮被选中
- 正则表达式 - 示例
- Set集合中元素的保存问题（hashSet和treeSet中不能存放相同元素）
- LeetCode——Climbing Stairs
- poj3641
- cocos2d-x_AnchorPoint锚点
- 犀牛——第19章JQuery类库 19.2 jQuery的getter 和setter
- C/C++、java对大小写的敏感性
- 想成为一个游戏程序员要有以下资料
- String Java常量池
- Android网络图片查看器
- 每天学点c++之七——const对象，const函数，析构函数
