题目：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 cl...
分类：
其他好文 时间：
2015-11-20 10:40:16
阅读次数：
120
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-11-19 16:24:48
阅读次数：
129
class Solution(object): def climbStairs(self, n): """ :type n: int :rtype: int """ if n <= 2: return ...
分类：
编程语言 时间：
2015-11-04 09:19:11
阅读次数：
152
Problem DescriptionAn 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 ...
分类：
其他好文 时间：
2015-11-02 11:40:10
阅读次数：
207
LeetCode -- Climbing Stairs...
分类：
其他好文 时间：
2015-10-17 01:53:19
阅读次数：
184
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-10-14 19:53:32
阅读次数：
118
题目：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 cl...
分类：
其他好文 时间：
2015-10-08 10:15:42
阅读次数：
137
Idea is the same: climbing up the hill along one edge (Greedy)! Visualize it in your mind!class Solution {public: /** * @param A: An integer ma...
分类：
其他好文 时间：
2015-10-06 08:05:31
阅读次数：
150
Question: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 ...
分类：
其他好文 时间：
2015-09-29 16:39:11
阅读次数：
153
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-09-25 11:09:53
阅读次数：
234
