-
Notifications
You must be signed in to change notification settings - Fork 0
/
EmployeeFreeTime.java
41 lines (35 loc) · 1.24 KB
/
EmployeeFreeTime.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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
package leetcode.hard;
import java.util.*;
public class EmployeeFreeTime {
public List<Interval> employeeFreeTime(List<List<Interval>> schedule) {
Queue<Interval> queue = new PriorityQueue<>((a, b) -> a.start - b.start);
for (List<Interval> intervals : schedule) {
for (Interval interval : intervals) {
queue.add(interval);
}
}
LinkedList<Interval> merged = new LinkedList<>();
while (!queue.isEmpty()) {
Interval current = queue.poll();
if (merged.isEmpty()) {
merged.add(current);
continue;
}
Interval last = merged.getLast();
if (current.start <= last.end) {
last.end = Math.max(last.end, current.end);
merged.set(merged.size() - 1, last);
} else {
merged.add(current);
}
}
List<Interval> result = new ArrayList<>();
Interval current = merged.removeFirst();
while (merged.size() > 0) {
Interval interval = merged.removeFirst();
result.add(new Interval(current.end, interval.start));
current = interval;
}
return result;
}
}