diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230/README.md"
index 12309e85a5a3a..cfc23846b8909 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230/README.md"	
@@ -204,6 +204,43 @@ func ladderLength(beginWord string, endWord string, wordList []string) int {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func ladderLength(_ beginWord: String, _ endWord: String, _ wordList: [String]) -> Int {
+        var words = Set(wordList)
+        var queue = [beginWord]
+        var ans = 1
+
+        while !queue.isEmpty {
+            for _ in 0..<queue.count {
+                let s = queue.removeFirst()
+                var chars = Array(s)
+                for j in 0..<chars.count {
+                    let ch = chars[j]
+                    for k in 0..<26 {
+                        chars[j] = Character(UnicodeScalar(k + 97)!)
+                        let t = String(chars)
+                        if !words.contains(t) {
+                            continue
+                        }
+                        if t == endWord {
+                            return ans + 1
+                        }
+                        queue.append(t)
+                        words.remove(t)
+                    }
+                    chars[j] = ch
+                }
+            }
+            ans += 1
+        }
+        return 0
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230/Solution.swift"
new file mode 100644
index 0000000000000..3d1231ac00c9e
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 108. \345\215\225\350\257\215\346\274\224\345\217\230/Solution.swift"	
@@ -0,0 +1,32 @@
+class Solution {
+    func ladderLength(_ beginWord: String, _ endWord: String, _ wordList: [String]) -> Int {
+        var words = Set(wordList)
+        var queue = [beginWord]
+        var ans = 1
+        
+        while !queue.isEmpty {
+            for _ in 0..<queue.count {
+                let s = queue.removeFirst()
+                var chars = Array(s)
+                for j in 0..<chars.count {
+                    let ch = chars[j]
+                    for k in 0..<26 {
+                        chars[j] = Character(UnicodeScalar(k + 97)!)
+                        let t = String(chars)
+                        if !words.contains(t) {
+                            continue
+                        }
+                        if t == endWord {
+                            return ans + 1
+                        }
+                        queue.append(t)
+                        words.remove(t)
+                    }
+                    chars[j] = ch
+                }
+            }
+            ans += 1
+        }
+        return 0
+    }
+}
\ No newline at end of file