对象= 属性＋方法 创建一个类对象 >>> tt = Turtle()>>> tt.climb()我正在努力的向前爬...>>> tt.bite()咬死你>>> tt.sleep()睡了 OO的特征（object oriented面向对象） 封装 信息隐蔽技术 继承 子类自动共享父类之间的数据和方法 ...
分类：
编程语言 时间：
2019-01-28 15:19:31
阅读次数：
271
题目描述： 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 ...
分类：
其他好文 时间：
2019-01-13 14:22:01
阅读次数：
167
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-12-31 00:56:28
阅读次数：
292
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-12-23 16:43:00
阅读次数：
172
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y ...
分类：
编程语言 时间：
2018-12-12 18:54:40
阅读次数：
204
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
世界高峰数据可视化 (World's Highest Mountains) 参考：https://www.kaggle.com/alex64/d/abcsds/highest-mountains/let-s-climb ...
分类：
其他好文 时间：
2018-11-08 18:27:34
阅读次数：
270
str2='''I will run, I will climb, I will soar I'm undefeated Jumpiing out of my skin, pull the chord Yeah I believe it The past, is everything we were... ...
分类：
其他好文 时间：
2018-10-21 12:10:47
阅读次数：
179
On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed). Once you pay the cost, you can either climb one or two steps. Y ...
分类：
编程语言 时间：
2018-09-30 19:57:30
阅读次数：
213
