[LEET-0] change variable names to be more descriptive

fishercoder1534 · fishercoder1534 · commit 5d6a85da4c25 · 2017-04-20T07:46:10.000-07:00
diff --git a/leetcode-algorithms/src/main/java/com/stevesun/solutions/CourseScheduleII.java b/leetcode-algorithms/src/main/java/com/stevesun/solutions/CourseScheduleII.java
@@ -34,17 +34,17 @@
 public class CourseScheduleII {
 
     public int[] findOrder(int numCourses, int[][] prerequisites) {
-        int[] degree = new int[numCourses];
+        int[] inDegree = new int[numCourses];
         for(int[] course : prerequisites){
-            degree[course[0]]++;
+            inDegree[course[0]]++;
         }
         
         Set<Integer> zeroDegree = new HashSet();
-        Queue<Integer> q = new LinkedList();
+        Queue<Integer> queue = new LinkedList();
         for(int i = 0; i < numCourses; i++){
-            if(degree[i] == 0) {
+            if(inDegree[i] == 0) {
                 zeroDegree.add(i);
-                q.offer(i);
+                queue.offer(i);
             }
         }
         
@@ -56,23 +56,23 @@ public int[] findOrder(int numCourses, int[][] prerequisites) {
             zeroDegree.remove(course);
             for(int[] pre : prerequisites){
                 if(course == pre[1]){
-                    degree[pre[0]]--;
-                    if(degree[pre[0]] == 0){
+                    inDegree[pre[0]]--;
+                    if(inDegree[pre[0]] == 0){
                         zeroDegree.add(pre[0]);
-                        q.offer(pre[0]);
+                        queue.offer(pre[0]);
                     }
                 }
             }
         }
         
         for(int i = 0; i < numCourses; i++){
-            if(degree[i] != 0) return new int[0];
+            if(inDegree[i] != 0) return new int[0];
         }
         
-        int[] result = new int[q.size()];
+        int[] result = new int[queue.size()];
         int i = 0;
-        while(!q.isEmpty()){
-            result[i++] = q.poll();
+        while(!queue.isEmpty()){
+            result[i++] = queue.poll();
         }
         return result;
     }

Original file line number	Diff line number	Diff line change
`@@ -34,17 +34,17 @@`
`34`	`34`	`public class CourseScheduleII {`
`35`	`35`
`36`	`36`	`public int[] findOrder(int numCourses, int[][] prerequisites) {`
`37`		`- int[] degree = new int[numCourses];`
	`37`	`+ int[] inDegree = new int[numCourses];`
`38`	`38`	`for(int[] course : prerequisites){`
`39`		`- degree[course[0]]++;`
	`39`	`+ inDegree[course[0]]++;`
`40`	`40`	`}`
`41`	`41`
`42`	`42`	`Set<Integer> zeroDegree = new HashSet();`
`43`		`- Queue<Integer> q = new LinkedList();`
	`43`	`+ Queue<Integer> queue = new LinkedList();`
`44`	`44`	`for(int i = 0; i < numCourses; i++){`
`45`		`- if(degree[i] == 0) {`
	`45`	`+ if(inDegree[i] == 0) {`
`46`	`46`	`zeroDegree.add(i);`
`47`		`- q.offer(i);`
	`47`	`+ queue.offer(i);`
`48`	`48`	`}`
`49`	`49`	`}`
`50`	`50`
`@@ -56,23 +56,23 @@ public int[] findOrder(int numCourses, int[][] prerequisites) {`
`56`	`56`	`zeroDegree.remove(course);`
`57`	`57`	`for(int[] pre : prerequisites){`
`58`	`58`	`if(course == pre[1]){`
`59`		`- degree[pre[0]]--;`
`60`		`- if(degree[pre[0]] == 0){`
	`59`	`+ inDegree[pre[0]]--;`
	`60`	`+ if(inDegree[pre[0]] == 0){`
`61`	`61`	`zeroDegree.add(pre[0]);`
`62`		`- q.offer(pre[0]);`
	`62`	`+ queue.offer(pre[0]);`
`63`	`63`	`}`
`64`	`64`	`}`
`65`	`65`	`}`
`66`	`66`	`}`
`67`	`67`
`68`	`68`	`for(int i = 0; i < numCourses; i++){`
`69`		`- if(degree[i] != 0) return new int[0];`
	`69`	`+ if(inDegree[i] != 0) return new int[0];`
`70`	`70`	`}`
`71`	`71`
`72`		`- int[] result = new int[q.size()];`
	`72`	`+ int[] result = new int[queue.size()];`
`73`	`73`	`int i = 0;`
`74`		`- while(!q.isEmpty()){`
`75`		`- result[i++] = q.poll();`
	`74`	`+ while(!queue.isEmpty()){`
	`75`	`+ result[i++] = queue.poll();`
`76`	`76`	`}`
`77`	`77`	`return result;`
`78`	`78`	`}`