本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss
摘要: 题目链接Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were ini... 阅读全文
posted @ 2014-05-07 23:13 tenos 阅读(944) 评论(0) 推荐(0) 编辑
摘要: 题目链接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].对若干... 阅读全文
posted @ 2014-05-07 21:38 tenos 阅读(1792) 评论(2) 推荐(0) 编辑
摘要: 题目链接 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,2... 阅读全文
posted @ 2014-05-07 12:48 tenos 阅读(895) 评论(0) 推荐(0) 编辑

本博客rss订阅地址: http://feed.cnblogs.com/blog/u/147990/rss

公益页面-寻找遗失儿童