2015年1月15日
[LeetCode#]Climbing Stairs
摘要： The problem:You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways c... 阅读全文
posted @ 2015-01-15 11:15 airforce 阅读(126) 评论(0) 推荐(0)
[LeetCode#57]Insert Interval
摘要： The problem:Given a set ofnon-overlappingintervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals we... 阅读全文
posted @ 2015-01-15 03:42 airforce 阅读(170) 评论(0) 推荐(0)
[LeetCode#56]Merge Intervals
摘要： The problem:Given a collection of intervals, merge all overlapping intervals.For example,Given[1,3],[2,6],[8,10],[15,18],return[1,6],[8,10],[15,18].My... 阅读全文
posted @ 2015-01-15 00:23 airforce 阅读(139) 评论(0) 推荐(0)