refactor 253

fishercoder1534 · fishercoder1534 · commit dcedd9f5963a · 2018-10-30T08:57:01.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_253.java b/src/main/java/com/fishercoder/solutions/_253.java
@@ -5,47 +5,42 @@
 import java.util.Arrays;
 import java.util.PriorityQueue;
 
-/**
- * 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.
- */
 public class _253 {
+    public static class Solution1 {
 
-    public int minMeetingRooms(Interval[] intervals) {
-        if (intervals == null || intervals.length == 0) {
-            return 0;
-        }
+        public int minMeetingRooms(Interval[] intervals) {
+            if (intervals == null || intervals.length == 0) {
+                return 0;
+            }
+
+            // Sort the intervals by start time
+            Arrays.sort(intervals, (a, b) -> a.start - b.start);
 
-        // Sort the intervals by start time
-        Arrays.sort(intervals, (a, b) -> a.start - b.start);
+            // Use a min heap to track the minimum end time of merged intervals
+            PriorityQueue<Interval> heap = new PriorityQueue<>(intervals.length, (a, b) -> a.end - b.end);
 
-        // Use a min heap to track the minimum end time of merged intervals
-        PriorityQueue<Interval> heap = new PriorityQueue<>(intervals.length, (a, b) -> a.end - b.end);
+            // start with the first meeting, put it to a meeting room
+            heap.offer(intervals[0]);
 
-        // start with the first meeting, put it to a meeting room
-        heap.offer(intervals[0]);
+            for (int i = 1; i < intervals.length; i++) {
+                // get the meeting room that finishes earliest
+                Interval interval = heap.poll();
 
-        for (int i = 1; i < intervals.length; i++) {
-            // get the meeting room that finishes earliest
-            Interval interval = heap.poll();
+                if (intervals[i].start >= interval.end) {
+                    // if the current meeting starts right after
+                    // there's no need for a new room, merge the interval
+                    interval.end = intervals[i].end;
+                } else {
+                    // otherwise, this meeting needs a new room
+                    heap.offer(intervals[i]);
+                }
 
-            if (intervals[i].start >= interval.end) {
-                // if the current meeting starts right after
-                // there's no need for a new room, merge the interval
-                interval.end = intervals[i].end;
-            } else {
-                // otherwise, this meeting needs a new room
-                heap.offer(intervals[i]);
+                // don't forget to put the meeting room back
+                heap.offer(interval);
             }
 
-            // don't forget to put the meeting room back
-            heap.offer(interval);
+            return heap.size();
         }
-
-        return heap.size();
     }
 }
+
