# 2406. Divide Intervals Into Minimum Number of Groups
###### tags: `Leetcode` `Medium` `Priority Queue`
Link: https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/
## 思路
和[0253. Meeting Rooms II](https://hackmd.io/-UTPnVO1SWqRc8em20pV0g)思路一样
## Code

class Solution {
    public int minGroups(int[][] intervals) {
        int n = intervals.length;
        int[] start = new int[n];
        int[] end = new int[n];
        for(int i=0; i<n; i++){
            start[i] = intervals[i][0];
            end[i] = intervals[i][1];
        }
        Arrays.sort(start);
        Arrays.sort(end);
        int rooms = 0;
        int p1 = 0;
        int p2 = 0;
        while(p1<n){
            if(start[p1]>end[p2]) p2++;
            else rooms++;
            p1++;
        }
        return rooms;
    }
}