forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
26 lines (26 loc) · 922 Bytes
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
/**
* 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; }
* }
*/
class Solution {
public List<Interval> insert(List<Interval> intervals, Interval newInterval) {
List<Interval> list = new LinkedList<>();
int i = 0;
while ((i < intervals.size()) && (intervals.get(i).end < newInterval.start)) list.add(intervals.get(i++));
while ((i < intervals.size()) && (intervals.get(i).start <= newInterval.end)) {
newInterval = new Interval(
Math.min(intervals.get(i).start, newInterval.start),
Math.max(intervals.get(i).end, newInterval.end)
);
i++;
}
list.add(newInterval);
while (i < intervals.size()) list.add(intervals.get(i++));
return list;
}
}