国产xxxx99真实实拍_久久不雅视频_高清韩国a级特黄毛片_嗯老师别我我受不了了小说

資訊專欄INFORMATION COLUMN

[LeetCode] Employee Free Time

go4it / 855人閱讀

Problem

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.

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]]

(Even though we are representing Intervals in the form [x, y], the objects inside are Intervals, not lists or arrays. For example, schedule0.start = 1, schedule0.end = 2, and schedule0[0] is not defined.)

Also, we wouldn"t include intervals like [5, 5] in our answer, as they have zero length.

Note:

schedule and schedule[i] are lists with lengths in range [1, 50].
0 <= schedule[i].start < schedule[i].end <= 10^8.

Solution
//put all intervals together, coz eventually we need 
//non-overlapping intervals from everyone

//Can use a PriorityQueue to sort all intervals by start
//or just use List and apply Collections.sort()
//several formats for customizing comparator
//https://www.mkyong.com/java8/java-8-lambda-comparator-example/

//after sorted, iterate the sorted list
//if (pre.end < cur.start) --> save new Interval(pre.end, cur.start)


class Solution {
    public List employeeFreeTime(List> schedule) {
        List res = new ArrayList<>();
        List times = new ArrayList<>();
        for (List list: schedule) {
            times.addAll(list);
        }
        Collections.sort(times, ((i1, i2)->i1.start-i2.start));
        Interval pre = times.get(0);
        for (int i = 1; i < times.size(); i++) {
            Interval cur = times.get(i);
            if (cur.start <= pre.end) {
                pre.end = cur.end > pre.end ? cur.end : pre.end;
            } else {
                res.add(new Interval(pre.end, cur.start));
                pre = cur;
            }    
        }
        return res;
    }
}

文章版權歸作者所有,未經允許請勿轉載,若此文章存在違規行為,您可以聯系管理員刪除。

轉載請注明本文地址:http://specialneedsforspecialkids.com/yun/77040.html

相關文章

  • leetcode690

    摘要:注意雖然員工也是員工的一個下屬,但是由于并不是直系下屬,因此沒有體現在員工的數據結構中。示例輸入輸出解釋員工自身的重要度是,他有兩個直系下屬和,而且和的重要度均為。并且利用加速查找。 題目地址:https://leetcode-cn.com/probl...題目描述:給定一個保存員工信息的數據結構,它包含了員工唯一的id,重要度 和 直系下屬的id。 比如,員工1是員工2的領導,員工2...

    kevin 評論0 收藏0
  • Java 8 新特性之Stream API

    摘要:簡而言之,提供了一種高效且易于使用的處理數據的方式。和以前的操作不同,操作還有兩個基礎的特征中間操作都會返回流對象本身。注意自己不會存儲元素不會改變源對象,相反,它們會返回一個持有結果的新操作時延遲執行的。為集合創建并行流。 1. 概述 1.1 簡介 Java 8 中有兩大最為重要的改革,第一個是 Lambda 表達式,另外一個則是 Stream API(java.util.strea...

    cooxer 評論0 收藏0

發表評論

0條評論

最新活動
閱讀需要支付1元查看
<