diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 116. \346\234\213\345\217\213\345\234\210/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 116. \346\234\213\345\217\213\345\234\210/README.md"
index cdf70fee2963e..be338f7fe4735 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 116. \346\234\213\345\217\213\345\234\210/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 116. \346\234\213\345\217\213\345\234\210/README.md"	
@@ -178,6 +178,40 @@ func findCircleNum(isConnected [][]int) int {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    private var isConnected: [[Int]] = []
+    private var visited: [Bool] = []
+    private var n: Int = 0
+
+    func findCircleNum(_ isConnected: [[Int]]) -> Int {
+        self.isConnected = isConnected
+        self.n = isConnected.count
+        self.visited = [Bool](repeating: false, count: n)
+        var numberOfCircles = 0
+
+        for i in 0..<n {
+            if !visited[i] {
+                dfs(i)
+                numberOfCircles += 1
+            }
+        }
+        return numberOfCircles
+    }
+
+    private func dfs(_ i: Int) {
+        visited[i] = true
+        for j in 0..<n {
+            if !visited[j] && isConnected[i][j] == 1 {
+                dfs(j)
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 116. \346\234\213\345\217\213\345\234\210/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 116. \346\234\213\345\217\213\345\234\210/Solution.swift"
new file mode 100644
index 0000000000000..b1e70c6aec534
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 116. \346\234\213\345\217\213\345\234\210/Solution.swift"	
@@ -0,0 +1,29 @@
+class Solution {
+    private var isConnected: [[Int]] = []
+    private var visited: [Bool] = []
+    private var n: Int = 0
+
+    func findCircleNum(_ isConnected: [[Int]]) -> Int {
+        self.isConnected = isConnected
+        self.n = isConnected.count
+        self.visited = [Bool](repeating: false, count: n)
+        var numberOfCircles = 0
+
+        for i in 0..<n {
+            if !visited[i] {
+                dfs(i)
+                numberOfCircles += 1
+            }
+        }
+        return numberOfCircles
+    }
+
+    private func dfs(_ i: Int) {
+        visited[i] = true
+        for j in 0..<n {
+            if !visited[j] && isConnected[i][j] == 1 {
+                dfs(j)
+            }
+        }
+    }
+}
\ No newline at end of file