You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb...
分类：
其他好文 时间：
2015-08-30 12:45:46
阅读次数：
146
Climbing Worm
Problem Description
An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches every minute, but then has to rest a minute before climbing agai...
分类：
其他好文 时间：
2015-08-25 21:49:30
阅读次数：
190
leetcode -Climbing StairsYou are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many di...
分类：
其他好文 时间：
2015-08-20 14:52:58
阅读次数：
107
UVa 12170 Easy Climb题目：http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=24844思路：引别人一个题解琢磨一下： from：http://blog.csdn.net/glqac/article/detail...
分类：
其他好文 时间：
2015-08-19 23:42:10
阅读次数：
217
https://leetcode.com/problems/climbing-stairs/题目：You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or...
分类：
其他好文 时间：
2015-08-08 16:13:47
阅读次数：
62
该题需要用数据结构来优化DP ，具体方法就是之前第八章讲的（用数据结构优化算法，紫书P241），使用一个数组和两个指针维护一个单调队列， 可以在O（n）的时间内求出滑动窗口中的最小值 。
有了这个优化我们就可以快速的求出dp[i-1][j]（x-d
然而刘汝佳就是不这么做，他只用了一个指针，连维护优先队列的数组都没开，就“隐式的”求出了最小值 。
具体做法是：
1.先维护窗口左边界，别让指...
分类：
其他好文 时间：
2015-08-06 22:35:01
阅读次数：
154
【070-Climbing Stairs（爬楼梯）】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】原题 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...
分类：
编程语言 时间：
2015-08-03 07:50:48
阅读次数：
177
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 cli...
分类：
其他好文 时间：
2015-08-02 16:25:34
阅读次数：
125
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?
爬台阶，你每次可以上一层或者两层，问上n层你共有多少何种...
分类：
其他好文 时间：
2015-08-01 20:40:22
阅读次数：
109
July 28, 2015Problem statement:You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how m...
分类：
其他好文 时间：
2015-07-31 14:43:06
阅读次数：
100
