2016年12月1日
[LintCode] Climbing Stairs 爬梯子问题
摘要： 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 阅读全文
posted @ 2016-12-01 13:52 Grandyang 阅读(185) 评论(0) 推荐(0)
Fork me on GitHub