diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227/README.md"
index c38278c1a11ec..914bc00a4aa7c 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227/README.md"	
@@ -221,6 +221,34 @@ var longestConsecutive = function (nums) {
 };
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func longestConsecutive(_ nums: [Int]) -> Int {
+        let n = nums.count
+        if n < 2 {
+            return n
+        }
+        
+        let sortedNums = Array(Set(nums)).sorted()
+        var ans = 1
+        var currentStreak = 1
+        
+        for i in 1..<sortedNums.count {
+            if sortedNums[i] == sortedNums[i - 1] + 1 {
+                currentStreak += 1
+                ans = max(ans, currentStreak)
+            } else {
+                currentStreak = 1
+            }
+        }
+        
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227/Solution.swift"
new file mode 100644
index 0000000000000..ff42f1c5b1949
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 119. \346\234\200\351\225\277\350\277\236\347\273\255\345\272\217\345\210\227/Solution.swift"	
@@ -0,0 +1,23 @@
+class Solution {
+    func longestConsecutive(_ nums: [Int]) -> Int {
+        let n = nums.count
+        if n < 2 {
+            return n
+        }
+        
+        let sortedNums = Array(Set(nums)).sorted()
+        var ans = 1
+        var currentStreak = 1
+        
+        for i in 1..<sortedNums.count {
+            if sortedNums[i] == sortedNums[i - 1] + 1 {
+                currentStreak += 1
+                ans = max(ans, currentStreak)
+            } else {
+                currentStreak = 1
+            }
+        }
+        
+        return ans
+    }
+}
\ No newline at end of file