摘要: leetcode 56. Merge Intervals Medium descrition Given a collection of intervals, merge all overlapping intervals. 解析 两个思路,都比较有难度。注意算法正确性的证明。 方法 1 连通分支 阅读全文
posted @ 2017-11-24 23:33 .....? 阅读(361) 评论(0) 推荐(0) 编辑
摘要: leetcode 55. Jump Game Medium descrition Given an array of non negative integers, you are initially positioned at the first index of the array. Each e 阅读全文
posted @ 2017-11-24 21:39 .....? 阅读(200) 评论(0) 推荐(0) 编辑