edit 207

fishercoder1534 · fishercoder1534 · commit 53552c251d47 · 2017-07-24T13:42:01.000-07:00
diff --git a/README.md b/README.md
@@ -374,7 +374,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CourseScheduleII.java)| O(?)|O(?) | Medium|
 |209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumSizeSubarraySum.java)| O(n)|O(1) | Medium|
 |208|[Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_208.java)| O(n)|O(1) | Medium| Trie
-|207|[Course Schedule](https://leetcode.com/problems/course-schedule/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CourseSchedule.java)| O(?)|O(?) | Medium|
+|207|[Course Schedule](https://leetcode.com/problems/course-schedule/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_207.java)| O(?)|O(?) | Medium|
 |206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_206.java)| O(n)|O(1) | Easy | Linked List
 |205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/)|[Solution](../../blmaster/src/94fishercoder/algorithms/IsomorphicStrings.java)| O(n)|O(1) | Easy
 |204|[Count Primes](https://leetcode.com/problems/count-primes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_204.java)| O(sqrt(n))|O(n) | Easy
diff --git a/src/main/java/com/fishercoder/solutions/_207.java b/src/main/java/com/fishercoder/solutions/_207.java
@@ -5,18 +5,19 @@
 import java.util.Set;
 
 /**There are a total of n courses you have to take, labeled from 0 to n - 1.
-
- Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pair: [0,1]
-
+ Some courses may have prerequisites, for example to take course 0 you have to first take course 1,
+ which is expressed as a pair: [0,1]
  Given the total number of courses and a list of prerequisite pairs, is it possible for you to finish all courses?
 
  For example:
-
  2, [[1,0]]
- There are a total of 2 courses to take. To take course 1 you should have finished course 0. So it is possible.
+ There are a total of 2 courses to take.
+ To take course 1 you should have finished course 0. So it is possible.
 
  2, [[1,0],[0,1]]
- There are a total of 2 courses to take. To take course 1 you should have finished course 0, and to take course 0 you should also have finished course 1. So it is impossible.
+ There are a total of 2 courses to take.
+ To take course 1 you should have finished course 0,
+ and to take course 0 you should also have finished course 1. So it is impossible.
 
  Note:
  The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
@@ -27,7 +28,7 @@
  This problem is equivalent to finding if a cycle exists in a directed graph. If a cycle exists, no topological ordering exists and therefore it will be impossible to take all courses.
  Topological Sort via DFS - A great video tutorial (21 minutes) on Coursera explaining the basic concepts of Topological Sort.
  Topological sort could also be done via BFS.*/
-public class CourseSchedule {
+public class _207 {
 
     public boolean canFinish(int numCourses, int[][] prerequisites) {
         int[] indegree = new int[numCourses];
diff --git a/src/test/java/com/fishercoder/_207Test.java b/src/test/java/com/fishercoder/_207Test.java
@@ -1,21 +1,21 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.CourseSchedule;
+import com.fishercoder.solutions._207;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class CourseScheduleTest {
-    private static CourseSchedule test;
+public class _207Test {
+    private static _207 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 = new _207();
     }
 
     @Test
