顺着前一题的思路,这一题做得很顺,除了对于list为0的情况考虑欠周,别的情况都考虑到了。加油!
/**
* 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; }
* }
*/
public class Solution {
public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
if (intervals == null) {
throw new IllegalArgumentException("haha");
}
// if (intervals.size() == 0 || newInterval == null) {
// return intervals;
// }
if (intervals.size() == 0) {
if (newInterval != null) {
intervals.add(newInterval);
}
return intervals;
}
List<Interval> res = new LinkedList<>();
int i = 0;
boolean flag = false;
for (; i < intervals.size(); i++) {
Interval cur = intervals.get(i);
if (newInterval.start > cur.end) {
res.add(cur);
} else if (newInterval.end < cur.start) {
res.add(newInterval);
res.add(cur);
i++;
flag = true;
break;
} else {
Interval merge = new Interval(Math.min(cur.start, newInterval.start), Math.max(cur.end, newInterval.end));
newInterval = merge;
}
}
if (!flag) {
res.add(newInterval);
}
if (flag) {
for (; i < intervals.size(); i++) {
Interval cur = intervals.get(i);
res.add(cur);
}
}
return res;
}
}
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]
.