开始刷leetcode day18:Climbing Stairs
来源:互联网 发布:sql union 不同字段 编辑:程序博客网 时间:2024/05/21 22:59
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;
if(n==2) return 2;
return climbStairs(n-1) + climbStairs(n-2);
}
}
失败了,超过时间
需要使用动态规划
public class Solution {
public int climbStairs(int n) {
if(n==0 || n==1) return n;
int[] result = new int[n+1];
result[1] = 1;
result[2] = 2;
for(int i=3;i<=n;i++)
{
result[i] = result[i-1] + result[i-2];
}
return result[n];
}
}
0 0
- 开始刷leetcode day18:Climbing Stairs
- 刷leetcode:Climbing Stairs
- [leetcode刷题系列]Climbing Stairs
- LeetCode刷题笔录Climbing Stairs
- LeetCode: Climbing Stairs
- LeetCode: Climbing Stairs
- [LeetCode]Climbing Stairs
- LeetCode Climbing Stairs
- [Leetcode] Climbing Stairs
- Leetcode: Climbing stairs
- LeetCode Climbing Stairs
- [LeetCode] Climbing Stairs
- leetcode 107: Climbing Stairs
- [LeetCode] Climbing Stairs
- [LeetCode]Climbing Stairs
- [leetcode]Climbing Stairs
- LeetCode-Climbing Stairs
- [leetcode] Climbing Stairs
- 第一篇博客
- Offset UITableView Content When Keyboard Appears
- 树形DP--HihoCoder 1104 Suzhou Adventure
- RabbitMQ(python实现)学习之二:Producer发送消息至多个消息队列queue(广播消息)
- String类
- 开始刷leetcode day18:Climbing Stairs
- Android-->阅读别人的项目源码
- Golang Channel用法简编
- vc中调用Com组件的方法详解
- Java内存分配机制和GC回收机制
- 通过域验证访问WebService
- windows8.1下U盘方式安装Ubantu15.04
- iOS - 创建表格类视图WBDataGridView
- 赢在习惯——高效能人士的七个成功法则