refactor 630

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_630.java

@@ -28,32 +28,23 @@ Given n online courses represented by pairs (t,d), your task is to find the maxi
  You can't take two courses simultaneously.
  */
 public class _630 {
-    /**Reference: https://discuss.leetcode.com/topic/93790/short-java-code-using-priorityqueue
-     * Sort by finish date!!! This is greedy! We should take those classes that finish early first.*/
-    public int scheduleCourse(int[][] courses) {
-        Arrays.sort(courses, (a,b) -> a[1] - b[1]);
-        int day = 0;
-        PriorityQueue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
-        for (int[] course : courses) {
-            day += course[0];
-            maxHeap.offer(course[0]);
-            if (day > course[1]) {
-                day -= maxHeap.poll();//drop the previous courses that took the most time
+    public static class Solution1 {
+        /**
+         * Reference: https://discuss.leetcode.com/topic/93790/short-java-code-using-priorityqueue
+         * Sort by finish date!!! This is greedy! We should take those classes that finish early first.
+         */
+        public int scheduleCourse(int[][] courses) {
+            Arrays.sort(courses, (a, b) -> a[1] - b[1]);
+            int day = 0;
+            PriorityQueue<Integer> maxHeap = new PriorityQueue<>((a, b) -> b - a);
+            for (int[] course : courses) {
+                day += course[0];
+                maxHeap.offer(course[0]);
+                if (day > course[1]) {
+                    day -= maxHeap.poll();//drop the previous courses that took the most time
+                }
             }
+            return maxHeap.size();
         }
-        return maxHeap.size();
-    }
-
-    public static void main(String... args) {
-        _630 test = new _630();
-        int[][] courses = new int[][]{
-                {100, 200},
-                {200, 1300},
-                {1000, 1250},
-                {2000, 3200},
-                {300, 1200}
-        };
-        test.scheduleCourse(courses);
-        System.out.println("Finished..");
     }
 }

src/test/java/com/fishercoder/_630Test.java

@@ -0,0 +1,30 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._630;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _630Test {
+    private static _630.Solution1 solution1;
+    private static int[][] courses;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _630.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        courses = new int[][]{
+                {100, 200},
+                {200, 1300},
+                {1000, 1250},
+                {2000, 3200},
+                {300, 1200}
+        };
+        assertEquals(3, solution1.scheduleCourse(courses));
+    }
+
+}