摘要: 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 @ 2015-11-15 12:02 eversliver 阅读(296) 评论(0) 推荐(0) 编辑
摘要: Given nums = [-2, 0, 3, -5, 2, -1]sumRange(0, 2) -> 1sumRange(2, 5) -> -1sumRange(0, 5) -> -3Note:You may assume that the array does not change.There ... 阅读全文
posted @ 2015-11-15 11:13 eversliver 阅读(338) 评论(0) 推荐(0) 编辑
摘要: After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This t... 阅读全文
posted @ 2015-11-15 10:02 eversliver 阅读(259) 评论(0) 推荐(0) 编辑