随笔分类 -  算法

摘要:Summary 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 ca 阅读全文
posted @ 2018-09-04 17:09 VEHVRBCH 阅读(71) 评论(0) 推荐(0)