【LeetCode】253.Meeting Rooms II(Medium)解题报告

最新推荐文章于 2024-07-30 10:22:26 发布

郝春雨

最新推荐文章于 2024-07-30 10:22:26 发布

阅读量707

点赞数

分类专栏： LeetCode Array 文章标签： leetcode

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79336924

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Array

65 篇文章 0 订阅

订阅专栏

【LeetCode】253.Meeting Rooms II(Medium)解题报告

题目地址：https://leetcode.com/problems/meeting-rooms-ii/（带锁题）
题目描述：

Given an array of meeting time intervals consisting of start and end times [[s1,e1],[s2,e2],…] (si < ei), find the minimum number of conference rooms required.
For example, Given [[0, 30],[5, 10],[15, 20]], return 2.

非常重要，面试经常出现。

Solution1:

time:O(nlogn)
space:O(n)
public int minMeetingRooms(Intervals[] intervals){
    int[] starts = new int[intervals.length];
    int[] ends = new int[intervals.length];
    for(int i=0 ; i<intervals.length ; i++){
        starts[i] = intervals[i].start;
        ends[i] = intervals[i].end;
    }
    Arrays.sort(starts);
    Arrays.sort(ends);
    int res = 0;
    int end = 0;
    for(int i=0 ; i<intervals.length ; i++){
        if(starts[i]<ends[end]){
            res++;
        }else end++;
    }
    return res;
}

Solution2：

time:O(nlogn)
space:O(n)
public int minMeetingRooms(Intervals[] intervals){
    Arrays.sort(intervals,(a,b)->a.start-b.start);
    PriorityQuene<Interval> heap = new PriorityQuene<>(intervals.length,(a,b)->a.end-b.end);
    heap.offer(intervals[0]);
    for(int i=1 ; i<intervals.length ; i++){
        Interval interval = heap.poll();
        if(intervals[i].start >= interval.end){
            interval.end = intervals[i].end;
        }else{
            heap.offer(intervals[i]);
        }
        heap.offer(interval);
    }
    return heap.size();
}