57. Insert Interval
题目链接:https://leetcode.com/problems...
public class Solution { public Listinsert(List intervals, Interval newInterval) { // skip intervals which not overlap with new one // intervals.get(i).end < newInterval.start List res = new ArrayList(); int i = 0, n = intervals.size(); while(i < n && intervals.get(i).end < newInterval.start) res.add(intervals.get(i++)); // merge the overlap part // intervals.get(i).start <= newInterval.end while(i < n && intervals.get(i).start <= newInterval.end) { newInterval.start = Math.min(newInterval.start, intervals.get(i).start); newInterval.end = Math.max(newInterval.end, intervals.get(i).end); i++; } res.add(newInterval); // add last intervals without overlap with new one while(i < n) res.add(intervals.get(i++)); return res; } }
文章版权归作者所有,未经允许请勿转载,若此文章存在违规行为,您可以联系管理员删除。
转载请注明本文地址:https://www.ucloud.cn/yun/69887.html
摘要:问题描述分析这道题的关键在于理解问题,抽取原型,理解中间可以部分如何界定,以及非部分如何进行追加。需要注意的是循环到最后一个元素和在最后一个元素的区别。 问题描述: Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You m...
摘要:题目要求给定一组顺序排列且相互之间没有重叠的区间,输入一个区间,将它插入到当前的区间数组中,并且将需要合并的区间合并,之后返回插入并且合并后的区间。我们将这三个类型的区间分别标注为类型,类型,类型。 题目要求 Given a set of non-overlapping intervals, insert a new interval into the intervals (merge...
摘要:我们只要把所有和该有重叠的合并到一起就行了。最后把前半部分的列表,合并后的大和后半部分的列表连起来,就是结果了。 Merge Intervals 最新更新请见 https://yanjia.me/zh/2019/02/... Given a collection of intervals, merge all overlapping intervals.For example, Gi...
Problem Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary). You may assume that the intervals were initially sorted according to their start times....
阅读 3233·2021-11-18 10:02
阅读 1936·2021-09-22 10:54
阅读 2988·2019-08-30 15:43
阅读 2575·2019-08-30 13:22
阅读 1574·2019-08-29 13:57
阅读 1041·2019-08-29 13:27
阅读 731·2019-08-26 14:05
阅读 2511·2019-08-26 13:30