[LeetCode 253] Meeting Rooms II

最新推荐文章于 2024-09-03 05:28:05 发布

原创最新推荐文章于 2024-09-03 05:28:05 发布 · 4.8k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #array #sorting

Leetcode 同时被 2 个专栏收录

287 篇文章

订阅专栏

Java

106 篇文章

订阅专栏

本文介绍了一种高效的算法，用于解决会议室预定冲突的问题。该算法通过将会议的开始时间和结束时间整理成列表，并根据绝对值进行排序，进而计算出所需的最小会议室数量。

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.

solution:

put start and negative end into list, sort it based on the absolute value. use two variable to record minimum meeting room

public int minMeetingRooms(Interval[] intervals) {
        int res = 0;
        if(intervals.length == 0) return res;
        if(intervals.length == 1) return res+1;
        List<Integer> points = new ArrayList<>();
        for(int i=0;i<intervals.length;i++) {
            points.add(intervals[i].start);
            points.add(-intervals[i].end);
        }
        Collections.sort(points, new Comparator<Integer>() {
            public int compare(Integer o1, Integer o2) {
                return Math.abs(o1) - Math.abs(o2);
            }
        });
        int local = 0;
        for(int i=0;i<points.size();i++) {
            if(points.get(i)>=0) {
                local++;
            }
            else local--;
            res = Math.max(local, res);
        }
        return res;
    }