Update Meeting Rooms II.java

Author: varunu28

Medium/Meeting Rooms II.java

@@ -1,29 +1,16 @@
 class Solution {
   public int minMeetingRooms(int[][] intervals) {
-    Arrays.sort(intervals, new Comparator<int[]>() {
-      @Override
-      public int compare(int[] o1, int[] o2) {
-        int c = o1[0] - o2[0];
-        if (c != 0) {
-          return c;
-        }
-        return o1[1] - o2[1];
+    Arrays.sort(intervals, Comparator.comparingInt((a) -> a[0]));
+    PriorityQueue<int[]> meetingsInProgress = new PriorityQueue<>(
+        Comparator.comparingInt((a) -> a[1]));
+    int result = 0;
+    for (int[] interval : intervals) {
+      while (!meetingsInProgress.isEmpty() && meetingsInProgress.peek()[1] <= interval[0]) {
+        meetingsInProgress.poll();
       }
-    });
-    PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<int[]>() {
-      @Override
-      public int compare(int[] o1, int[] o2) {
-        return o1[1] - o2[1];
-      }
-    });
-    int maxCount = 0;
-    for (int i = 0; i < intervals.length; i++) {
-      while (!pq.isEmpty() && pq.peek()[1] <= intervals[i][0]) {
-        pq.poll();
-      }
-      pq.add(intervals[i]);
-      maxCount = Math.max(maxCount, pq.size());
+      meetingsInProgress.add(interval);
+      result = Math.max(result, meetingsInProgress.size());
     }
-    return maxCount;
+    return result;
   }
 }