2017年7月18日
[LeetCode] 632. Smallest Range Covering Elements from K Lists 覆盖K个列表元素的最小区间
摘要： You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists. We define 阅读全文
posted @ 2017-07-18 13:26 Grandyang 阅读(9491) 评论(4) 推荐(2)
Fork me on GitHub