diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md"
index 7bece72ba906c..14fb67e2ab339 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/README.md"	
@@ -188,6 +188,35 @@ func lenLongestFibSubseq(arr []int) int {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func lenLongestFibSubseq(_ arr: [Int]) -> Int {
+        let n = arr.count
+        var mp = [Int: Int]()
+        for i in 0..<n {
+            mp[arr[i]] = i
+        }
+        
+        var dp = Array(repeating: Array(repeating: 2, count: n), count: n)
+        var ans = 0
+        
+        for i in 0..<n {
+            for j in 0..<i {
+                let delta = arr[i] - arr[j]
+                if let k = mp[delta], k < j {
+                    dp[j][i] = dp[k][j] + 1
+                    ans = max(ans, dp[j][i])
+                }
+            }
+        }
+        
+        return ans > 2 ? ans : 0
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/Solution.swift"
new file mode 100644
index 0000000000000..4149dafe4b8c2
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 093. \346\234\200\351\225\277\346\226\220\346\263\242\351\202\243\345\245\221\346\225\260\345\210\227/Solution.swift"	
@@ -0,0 +1,24 @@
+class Solution {
+    func lenLongestFibSubseq(_ arr: [Int]) -> Int {
+        let n = arr.count
+        var mp = [Int: Int]()
+        for i in 0..<n {
+            mp[arr[i]] = i
+        }
+        
+        var dp = Array(repeating: Array(repeating: 2, count: n), count: n)
+        var ans = 0
+        
+        for i in 0..<n {
+            for j in 0..<i {
+                let delta = arr[i] - arr[j]
+                if let k = mp[delta], k < j {
+                    dp[j][i] = dp[k][j] + 1
+                    ans = max(ans, dp[j][i])
+                }
+            }
+        }
+        
+        return ans > 2 ? ans : 0
+    }
+}
\ No newline at end of file