摘要: 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-06-24 23:12 欠扁的小篮子 阅读(3793) 评论(0) 推荐(0) 编辑
摘要: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is a 阅读全文
posted @ 2016-06-24 22:27 欠扁的小篮子 阅读(1504) 评论(0) 推荐(0) 编辑