[LEET-0] move test out

Author: fishercoder1534

leetcode-algorithms/src/main/java/com/stevesun/solutions/CourseSchedule.java

@@ -29,7 +29,7 @@
  Topological sort could also be done via BFS.*/
 public class CourseSchedule {
 
-    public static boolean canFinish(int numCourses, int[][] prerequisites) {
+    public boolean canFinish(int numCourses, int[][] prerequisites) {
         int[] indegree = new int[numCourses];
         for(int[] prereq : prerequisites){
             indegree[prereq[0]]++;
@@ -57,11 +57,5 @@ public static boolean canFinish(int numCourses, int[][] prerequisites) {
         }
         return true;
     }
-    
-    public static void main(String...strings){
-        int numCourses = 2;
-        int[][] prerequisites = new int[][]{{0,1}};
-        System.out.print(canFinish(numCourses, prerequisites));
-    }
 
 }

leetcode-algorithms/src/test/java/com/stevesun/CourseScheduleTest.java

@@ -0,0 +1,29 @@
+package com.stevesun;
+
+import com.stevesun.solutions.CourseSchedule;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+public class CourseScheduleTest {
+    private static CourseSchedule test;
+    private static boolean actual;
+    private static boolean expected;
+    private static int[][] prerequisites;
+    private static int numCourses;
+
+    @BeforeClass
+    public static void setup(){
+        test = new CourseSchedule();
+    }
+
+    @Test
+    public void test1(){
+        numCourses = 2;
+        prerequisites = new int[][]{{0, 1}};
+        expected = true;
+        actual = test.canFinish(numCourses, prerequisites);
+        assertEquals(expected, actual);
+    }
+}