edit 210

fishercoder1534 · fishercoder1534 · commit 11ed10ca4a08 · 2017-07-24T13:43:35.000-07:00
diff --git a/README.md b/README.md
@@ -371,7 +371,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |213|[House Robber II](https://leetcode.com/problems/house-robber-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_213.java)| O(n)|O(n)| Medium | DP
 |212|[Word Search II](https://leetcode.com/problems/word-search-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/WordSearchII.java)| O(m*n*l)|O(l) | Hard | Trie
 |211|[Add and Search Word - Data structure design](https://leetcode.com/problems/add-and-search-word-data-structure-design/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_211.java)| O(n)|O(h) | Medium| Trie
-|210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CourseScheduleII.java)| O(?)|O(?) | Medium|
+|210|[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_210.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/_207.java)| O(?)|O(?) | Medium|
diff --git a/src/main/java/com/fishercoder/solutions/_210.java b/src/main/java/com/fishercoder/solutions/_210.java
@@ -7,20 +7,26 @@
 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]
+ Given the total number of courses and a list of prerequisite pairs,
+ return the ordering of courses you should take to finish all courses.
 
- 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, return the ordering of courses you should take to finish all courses.
-
- There may be multiple correct orders, you just need to return one of them. If it is impossible to finish all courses, return an empty array.
+ There may be multiple correct orders,
+ you just need to return one of them.
+ If it is impossible to finish all courses, return an empty array.
 
  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 the correct course order is [0,1]
+ There are a total of 2 courses to take.
+ To take course 1 you should have finished course 0. So the correct course order is [0,1]
 
  4, [[1,0],[2,0],[3,1],[3,2]]
- There are a total of 4 courses to take. To take course 3 you should have finished both courses 1 and 2. Both courses 1 and 2 should be taken after you finished course 0. So one correct course order is [0,1,2,3]. Another correct ordering is[0,2,1,3].
+ There are a total of 4 courses to take.
+ To take course 3 you should have finished both courses 1 and 2.
+ Both courses 1 and 2 should be taken after you finished course 0.
+ So one correct course order is [0,1,2,3]. Another correct ordering is[0,2,1,3].
 
  Note:
  The input prerequisites is a graph represented by a list of edges, not adjacency matrices. Read more about how a graph is represented.
@@ -31,7 +37,7 @@
  This problem is equivalent to finding the topological order 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 CourseScheduleII {
+public class _210 {
 
     public int[] findOrder(int numCourses, int[][] prerequisites) {
         int[] inDegree = new int[numCourses];
