https://leetcode.com/problems/climbing-stairs/ You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 o ...
分类：
其他好文 时间：
2018-11-19 10:59:35
阅读次数：
205
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... ...
分类：
其他好文 时间：
2018-11-17 10:58:58
阅读次数：
120
分析 难度 易 来源 https://leetcode.com/problems/climbing-stairs/ 题目 You are climbing a stair case. It takes n steps to reach to the top. Each time you can ei ...
分类：
其他好文 时间：
2018-10-29 22:58:39
阅读次数：
202
题目 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 ...
分类：
其他好文 时间：
2018-09-30 12:48:15
阅读次数：
128
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 cl ...
分类：
其他好文 时间：
2018-09-23 16:26:11
阅读次数：
205
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 cl ...
分类：
其他好文 时间：
2018-09-11 22:31:42
阅读次数：
195
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 cl ...
分类：
其他好文 时间：
2018-09-10 11:59:18
阅读次数：
166
dp[i] means the minimum cost to reach i-th (index start from 0) stair. DP formula: dp[i] = min(dp[i-1], dp[i-2])+cost[i] i>=2 base cases: dp[0]=cost[0 ...
分类：
其他好文 时间：
2018-04-22 21:47:15
阅读次数：
130
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 cl ...
分类：
其他好文 时间：
2018-04-07 17:48:48
阅读次数：
117
题目： 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 yo ...
分类：
其他好文 时间：
2018-04-06 10:59:10
阅读次数：
139
