From eeaed4ccebaec8ce9f6c405f2cd94c3ab74b4412 Mon Sep 17 00:00:00 2001
From: Lanre Adedara <lanre.adedara@shara.co>
Date: Wed, 30 Oct 2024 08:37:17 +0100
Subject: [PATCH] feat: add swift implementation to lcof2 problem: No.113

---
 .../README.md"                                | 40 +++++++++++++++++++
 .../Solution.swift"                           | 35 ++++++++++++++++
 2 files changed, 75 insertions(+)
 create mode 100644 "lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/Solution.swift"

diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/README.md"
index 52e72ae62a670..f8ee6368db33d 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/README.md"	
@@ -269,6 +269,46 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func findOrder(_ numCourses: Int, _ prerequisites: [[Int]]) -> [Int] {
+        var graph = Array(repeating: [Int](), count: numCourses)
+        var indegree = Array(repeating: 0, count: numCourses)
+        
+        for prereq in prerequisites {
+            let course = prereq[0]
+            let prereqCourse = prereq[1]
+            graph[prereqCourse].append(course)
+            indegree[course] += 1
+        }
+        
+        var queue = [Int]()
+        for i in 0..<numCourses {
+            if indegree[i] == 0 {
+                queue.append(i)
+            }
+        }
+        
+        var order = [Int]()
+        while !queue.isEmpty {
+            let course = queue.removeFirst()
+            order.append(course)
+            
+            for nextCourse in graph[course] {
+                indegree[nextCourse] -= 1
+                if indegree[nextCourse] == 0 {
+                    queue.append(nextCourse)
+                }
+            }
+        }
+        
+        return order.count == numCourses ? order : []
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/Solution.swift"
new file mode 100644
index 0000000000000..3bb5be6ec4b4d
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 113. \350\257\276\347\250\213\351\241\272\345\272\217/Solution.swift"	
@@ -0,0 +1,35 @@
+class Solution {
+    func findOrder(_ numCourses: Int, _ prerequisites: [[Int]]) -> [Int] {
+        var graph = Array(repeating: [Int](), count: numCourses)
+        var indegree = Array(repeating: 0, count: numCourses)
+        
+        for prereq in prerequisites {
+            let course = prereq[0]
+            let prereqCourse = prereq[1]
+            graph[prereqCourse].append(course)
+            indegree[course] += 1
+        }
+        
+        var queue = [Int]()
+        for i in 0..<numCourses {
+            if indegree[i] == 0 {
+                queue.append(i)
+            }
+        }
+        
+        var order = [Int]()
+        while !queue.isEmpty {
+            let course = queue.removeFirst()
+            order.append(course)
+            
+            for nextCourse in graph[course] {
+                indegree[nextCourse] -= 1
+                if indegree[nextCourse] == 0 {
+                    queue.append(nextCourse)
+                }
+            }
+        }
+        
+        return order.count == numCourses ? order : []
+    }
+}
\ No newline at end of file