solve meeting rooms 2

Author: sora0319

meeting-rooms-ii/sora0319.java

@@ -0,0 +1,33 @@
+public class Solution {
+    public int minMeetingRooms(int[][] intervals) {
+        int n = intervals.length;
+        int[] starts = new int[n];
+        int[] ends = new int[n];
+
+        for (int i = 0; i < n; i++) {
+            starts[i] = intervals[i][0];
+            ends[i] = intervals[i][1];
+        }
+
+        Arrays.sort(starts);
+        Arrays.sort(ends);
+
+        int maxCount = 0;
+        int count = 0;
+        int s = 0;
+        int e = 0;
+
+        while (s < n) {
+            if (starts[s] < ends[e]) {
+                count++;
+                maxCount = Math.max(maxCount, count);
+                s++;
+            } else {
+                count--;
+                e++;
+            }
+        }
+
+        return maxCount;
+    }
+}