【LeetCode】57.Insert Interval(Medium)解题报告
题目地址:https://leetcode.com/problems/merge-intervals/description/
题目描述:
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.
Example 1:Given intervals [1,3],[6,9], insert and merge [2,5] in as [1,5],[6,9].
Example 2:Given [1,2],[3,5],[6,7],[8,10],[12,16], insert and merge [4,9] in as [1,2],[3,10],[12,16].
This is because the new interval [4,9] overlaps with [3,5],[6,7],[8,10].
很重要,面试出现。
Solution:
/**
* Definition for an interval.
* public class Interval {
* int start;
* int end;
* Interval() { start = 0; end = 0; }
* Interval(int s, int e) { start = s; end = e; }
* }
*/
//time:O(n)
//space:O(n)
class Solution {
public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
if(newInterval == null) return intervals;
List<Interval> res = new ArrayList<>();
int i=0;
while(i<intervals.size() && intervals.get(i).end<newInterval.start){
res.add(intervals.get(i++));
}
while(i<intervals.size() && intervals.get(i).start<=newInterval.end){
newInterval.start = Math.min(intervals.get(i).start,newInterval.start);
newInterval.end = Math.max(intervals.get(i).end,newInterval.end);
i++;
}
res.add(newInterval);
while(i<intervals.size()){
res.add(intervals.get(i++));
}
return res;
}
}
Date:2018年2月19日