leetcode - 759. Employee Free Time

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 <= 50
0 <= schedule[i].start < schedule[i].end <= 10^8

Solution

Merge Intervals

Flatten the free time, and sweep from left to right, if there’s an overlap, then merge the interval.

Time complexity: $o(n\log n)$ for sorting
Space complexity: $o(n)$

Line Sweep

Flatten the free time, and every time we visit a start, we increase the counter by 1, and decrease by 1 for the end. Whenever the counter is 0, we found a free interval.

Time complexity: $o(n\log n)$
Space complexity: $o(n)$

Code

Merge Intervals

"""
# 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]':
        # flatten the intervals
        intervals = []
        for each_employee in schedule:
            for em_interval in each_employee:
                intervals.append((em_interval.start, em_interval.end))
        intervals.sort()
        res = []
        prev_start, prev_end = intervals[0]
        for i in range(1, len(intervals)):
            # if overlap, merge
            if prev_start <= intervals[i][1] and prev_end >= intervals[i][0]:
                prev_start, prev_end = min(prev_start, intervals[i][0]), max(prev_end, intervals[i][1])
            else:
                res.append(Interval(prev_end, intervals[i][0]))
                prev_start, prev_end = intervals[i]
        return res

Line Sweep

"""
# 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 each_employee in schedule:
            for each_interval in each_employee:
                intervals.append((each_interval.start, 1))
                intervals.append((each_interval.end, -1))
        intervals.sort(key=lambda x: (x[0], -x[1]))
        res = []
        cnter = 0
        for interval_edge, status in intervals:
            if cnter == 0 and len(res) != 0:
                res[-1].append(interval_edge)
            cnter += status
            if cnter == 0:
                res.append([interval_edge])
        res = [Interval(item[0], item[1]) for item in res[:-1]]
        return res