Description
We are given a list schedule of employees, which represents the working time for each employee.
Each employee has a list of non-overlapping Intervals, and these intervals are in sorted order.
Return the list of finite intervals representing common, positive-length free time for all employees, also in sorted order.
(Even though we are representing Intervals in the form [x, y], the objects inside are Intervals, not lists or arrays. For example, schedule[0][0].start = 1, schedule[0][0].end = 2, and schedule[0][0][0] is not defined). Also, we wouldn't include intervals like [5, 5] in our answer, as they have zero length.
Example 1:
Input: schedule = [[[1,2],[5,6]],[[1,3]],[[4,10]]]
Output: [[3,4]]
Explanation: There are a total of three employees, and all common
free time intervals would be [-inf, 1], [3, 4], [10, inf].
We discard any intervals that contain inf as they aren't finite.
Example 2:
Input: schedule = [[[1,3],[6,7]],[[2,4]],[[2,5],[9,12]]]
Output: [[5,6],[7,9]]
Constraints:
1 <= schedule.length , schedule[i].length <= 500 <= schedule[i].start < schedule[i].end <= 10^8
Solutions
Solution 1: Interval Merging
We can merge all employees' working time intervals into a single list, then sort and merge the overlapping intervals. Finally, we traverse the merged interval list to find the free time periods between adjacent intervals.
The time complexity is O(mn log(mn)) and the space complexity is O(mn), where m is the number of employees and n is the number of working intervals per employee.
PythonJavaC++GoTypeScript
"""
# Definition for an Interval.
class Interval:
def __init__(self, start: int = None, end: int = None):
self.start = start
self.end = end
"""
class Solution:
def employeeFreeTime(self, schedule: "[[Interval]]") -> "[Interval]":
intervals = []
for e in schedule:
intervals.extend(e)
intervals.sort(key=lambda x: (x.start, x.end))
merged = [intervals[0]]
for x in intervals[1:]:
if merged[-1].end < x.start:
merged.append(x)
else:
merged[-1].end = max(merged[-1].end, x.end)
ans = []
for a, b in pairwise(merged):
ans.append(Interval(a.end, b.start))
return ans(code-box)
/*
// Definition for an Interval.
class Interval {
public int start;
public int end;
public Interval() {}
public Interval(int _start, int _end) {
start = _start;
end = _end;
}
};
*/
class Solution {
public List<Interval> employeeFreeTime(List<List<Interval>> schedule) {
List<Interval> intervals = new ArrayList<>();
for (List<Interval> e : schedule) {
intervals.addAll(e);
}
intervals.sort((a, b) -> a.start == b.start ? a.end - b.end : a.start - b.start);
List<Interval> merged = new ArrayList<>();
merged.add(intervals.get(0));
for (int i = 1; i < intervals.size(); ++i) {
Interval last = merged.get(merged.size() - 1);
Interval cur = intervals.get(i);
if (last.end < cur.start) {
merged.add(cur);
} else {
last.end = Math.max(last.end, cur.end);
}
}
List<Interval> ans = new ArrayList<>();
for (int i = 1; i < merged.size(); ++i) {
Interval a = merged.get(i - 1);
Interval b = merged.get(i);
ans.add(new Interval(a.end, b.start));
}
return ans;
}
}(code-box)
/*
// Definition for an Interval.
class Interval {
public:
int start;
int end;
Interval() {}
Interval(int _start, int _end) {
start = _start;
end = _end;
}
};
*/
class Solution {
public:
vector<Interval> employeeFreeTime(vector<vector<Interval>> schedule) {
vector<Interval> intervals;
for (auto& e : schedule) {
intervals.insert(intervals.end(), e.begin(), e.end());
}
sort(intervals.begin(), intervals.end(), [](const Interval& a, const Interval& b) {
if (a.start == b.start) return a.end < b.end;
return a.start < b.start;
});
vector<Interval> merged;
merged.push_back(intervals[0]);
for (int i = 1; i < intervals.size(); ++i) {
auto& last = merged.back();
auto& cur = intervals[i];
if (last.end < cur.start) {
merged.push_back(cur);
} else {
last.end = max(last.end, cur.end);
}
}
vector<Interval> ans;
for (int i = 1; i < merged.size(); ++i) {
auto& a = merged[i - 1];
auto& b = merged[i];
ans.emplace_back(a.end, b.start);
}
return ans;
}
};(code-box)
/**
* Definition for an Interval.
* type Interval struct {
* Start int
* End int
* }
*/
func employeeFreeTime(schedule [][]*Interval) []*Interval {
var intervals []*Interval
for _, e := range schedule {
intervals = append(intervals, e...)
}
sort.Slice(intervals, func(i, j int) bool {
if intervals[i].Start == intervals[j].Start {
return intervals[i].End < intervals[j].End
}
return intervals[i].Start < intervals[j].Start
})
merged := []*Interval{intervals[0]}
for _, cur := range intervals[1:] {
last := merged[len(merged)-1]
if last.End < cur.Start {
merged = append(merged, cur)
} else if cur.End > last.End {
last.End = cur.End
}
}
var ans []*Interval
for i := 1; i < len(merged); i++ {
a, b := merged[i-1], merged[i]
ans = append(ans, &Interval{Start: a.End, End: b.Start})
}
return ans
}(code-box)
/**
* // Definition for an Interval.
* class Interval {
* start: number;
* end: number;
* constructor(start: number, end: number) {
* this.start = start;
* this.end = end;
* }
* }
*/
function employeeFreeTime(schedule: Interval[][]): Interval[] {
const intervals: Interval[] = [];
for (const e of schedule) {
intervals.push(...e);
}
intervals.sort((a, b) => (a.start === b.start ? a.end - b.end : a.start - b.start));
const merged: Interval[] = [intervals[0]];
for (let i = 1; i < intervals.length; ++i) {
const last = merged[merged.length - 1];
const cur = intervals[i];
if (last.end < cur.start) {
merged.push(cur);
} else {
last.end = Math.max(last.end, cur.end);
}
}
const ans: Interval[] = [];
for (let i = 1; i < merged.length; ++i) {
const a = merged[i - 1];
const b = merged[i];
ans.push(new Interval(a.end, b.start));
}
return ans;
}(code-box)
