Graph (soapyigu#373)

* Refactor code style for course schedule I & II * Delete redundant solutions * Refactor code style
Ngoys · Jan 13, 2023 · e9253b8 · e9253b8
1 parent bcbd9ce
commit e9253b8
Show file tree

Hide file tree

Showing 4 changed files with 25 additions and 165 deletions.
diff --git a/DFS/CourseSchedule.swift b/DFS/CourseSchedule.swift
diff --git a/DFS/CourseScheduleII.swift b/DFS/CourseScheduleII.swift
diff --git a/Graph/CourseSchedule.swift b/Graph/CourseSchedule.swift
@@ -15,25 +15,21 @@
             toCourses[courses[1], default:[]].append(courses[0])
         }
 
-        var queue = (0..<numCourses).filter { inDegrees[$0] == 0 }, validCourseCount = 0
+        var queue = (0..<numCourses).filter { inDegrees[$0] == 0 }, validCoursesCount = 0
 
         while !queue.isEmpty {
             let course = queue.removeFirst()
 
-            validCourseCount += 1
+            validCoursesCount += 1
 
-            guard let toCourses = toCourses[course] else {
-                continue
-            }
-
-            for toCourse in toCourses {
+            for toCourse in toCourses[course] ?? [] {
                 inDegrees[toCourse] -= 1
                 if inDegrees[toCourse] == 0 {
                     queue.append(toCourse)
                 }
             }
         }
 
-        return validCourseCount == numCourses
+        return validCoursesCount == numCourses
     }
-}
+}
diff --git a/Graph/CourseScheduleII.swift b/Graph/CourseScheduleII.swift
@@ -6,36 +6,30 @@
  *
  */
 
- class CourseScheduleII {
+class CourseScheduleII {
     func findOrder(_ numCourses: Int, _ prerequisites: [[Int]]) -> [Int] {
-        var inDegrees = Array(repeating: 0, count: numCourses), fromTo = [Int: [Int]]()
-        var coursesCouldTake = [Int]()
-
-        // init graph
-        for prerequisite in prerequisites {
-            fromTo[prerequisite[1], default: []].append(prerequisite[0])
-            inDegrees[prerequisite[0]] += 1
+        var indegrees = Array(repeating: 0, count: numCourses), toCourses = [Int: [Int]]()
+
+        for pres in prerequisites {
+            indegrees[pres[0]] += 1
+            toCourses[pres[1], default: []].append(pres[0])
         }
-        
-        var queue = (0..<numCourses).filter { inDegrees[$0] == 0 }
-        
+
+        var queue = (0..<numCourses).filter { indegrees[$0] == 0 }, result = [Int]()
+
         while !queue.isEmpty {
-            let currentCourse = queue.removeFirst()
-            coursesCouldTake.append(currentCourse)
-
-            guard let toCourses = fromTo[currentCourse] else {
-                continue
-            }
-
-            toCourses.forEach { 
-                inDegrees[$0] -= 1 
-
-                if inDegrees[$0] == 0 {
-                    queue.append($0)
+            let course = queue.removeFirst()
+
+            result.append(course)
+
+            for toCourse in toCourses[course] ?? [] {
+                indegrees[toCourse] -= 1
+                if indegrees[toCourse] == 0 {
+                    queue.append(toCourse)
                 }
             }
         }
-    
-        return coursesCouldTake.count == numCourses ? coursesCouldTake : [Int]()
+
+        return result.count == numCourses ? result : [Int]()
     }
-}
+}