Description: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 c...
分类：
其他好文 时间：
2015-06-17 19:58:55
阅读次数：
109
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?
设到第i台阶有A[i]
那么到第1台阶有A[1]=...
分类：
其他好文 时间：
2015-06-15 00:18:50
阅读次数：
111
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阶的台阶，你一次最多只能上2个台阶，请问一共有多少个走法？...
分类：
其他好文 时间：
2015-06-14 13:50:57
阅读次数：
167
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 distinct way...
分类：
编程语言 时间：
2015-06-14 07:01:17
阅读次数：
292
题目链接 题目要求 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 wa...
分类：
其他好文 时间：
2015-06-09 19:35:32
阅读次数：
99
前言
Life’s a climb, but the view is great.
1.创建线程的三种方式1.1 继承Thread1.2 实现Runnable1.3 实现Callable2.线程的状态2.1 五种状态：创建，就绪，运行，阻塞，死亡2.2 终止线程：自然终止、外部干涉2.3 阻塞：join、yield、sleepsleep方法与wait方法的区别：两则从属的类不同
sleep...
分类：
编程语言 时间：
2015-05-28 21:31:05
阅读次数：
179
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-05-27 08:33:16
阅读次数：
100
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-05-16 20:11:55
阅读次数：
134
1- 问题描述 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 .....
分类：
其他好文 时间：
2015-05-13 12:45:35
阅读次数：
115
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?
解题思路：
动态规划，类似于斐波那契数列。
X X X....
分类：
其他好文 时间：
2015-05-07 14:28:31
阅读次数：
103
