diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 115. \351\207\215\345\273\272\345\272\217\345\210\227/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 115. \351\207\215\345\273\272\345\272\217\345\210\227/README.md"
index 3f1b34527a0af..2b1f18bc59a6a 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 115. \351\207\215\345\273\272\345\272\217\345\210\227/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 115. \351\207\215\345\273\272\345\272\217\345\210\227/README.md"	
@@ -250,6 +250,46 @@ function sequenceReconstruction(nums: number[], sequences: number[][]): boolean
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func sequenceReconstruction(_ nums: [Int], _ sequences: [[Int]]) -> Bool {
+        let n = nums.count
+        var indegree = [Int](repeating: 0, count: n)
+        var graph = Array(repeating: [Int](), count: n)
+
+        for sequence in sequences {
+            for i in 1..<sequence.count {
+                let a = sequence[i - 1] - 1
+                let b = sequence[i] - 1
+                graph[a].append(b)
+                indegree[b] += 1
+            }
+        }
+
+        var queue = [Int]()
+        for i in 0..<n {
+            if indegree[i] == 0 {
+                queue.append(i)
+            }
+        }
+
+        while queue.count == 1 {
+            let i = queue.removeFirst()
+            for neighbor in graph[i] {
+                indegree[neighbor] -= 1
+                if indegree[neighbor] == 0 {
+                    queue.append(neighbor)
+                }
+            }
+        }
+
+        return queue.isEmpty
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 115. \351\207\215\345\273\272\345\272\217\345\210\227/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 115. \351\207\215\345\273\272\345\272\217\345\210\227/Solution.swift"
new file mode 100644
index 0000000000000..16fc600079abb
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 115. \351\207\215\345\273\272\345\272\217\345\210\227/Solution.swift"	
@@ -0,0 +1,35 @@
+class Solution {
+    func sequenceReconstruction(_ nums: [Int], _ sequences: [[Int]]) -> Bool {
+        let n = nums.count
+        var indegree = [Int](repeating: 0, count: n)
+        var graph = Array(repeating: [Int](), count: n)
+
+        for sequence in sequences {
+            for i in 1..<sequence.count {
+                let a = sequence[i - 1] - 1
+                let b = sequence[i] - 1
+                graph[a].append(b)
+                indegree[b] += 1
+            }
+        }
+
+        var queue = [Int]()
+        for i in 0..<n {
+            if indegree[i] == 0 {
+                queue.append(i)
+            }
+        }
+
+        while queue.count == 1 {
+            let i = queue.removeFirst()
+            for neighbor in graph[i] {
+                indegree[neighbor] -= 1
+                if indegree[neighbor] == 0 {
+                    queue.append(neighbor)
+                }
+            }
+        }
+
+        return queue.isEmpty
+    }
+}
\ No newline at end of file