diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 100. \344\270\211\350\247\222\345\275\242\344\270\255\346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/README.md" "b/lcof2/\345\211\221\346\214\207 Offer II 100. \344\270\211\350\247\222\345\275\242\344\270\255\346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/README.md"
index ee4cb53c0361f..242e402eb0aa4 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 100. \344\270\211\350\247\222\345\275\242\344\270\255\346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/README.md"	
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 100. \344\270\211\350\247\222\345\275\242\344\270\255\346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/README.md"	
@@ -155,6 +155,25 @@ class Solution:
         return dp[0]
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func minimumTotal(_ triangle: [[Int]]) -> Int {
+        let n = triangle.count
+        var dp = Array(repeating: 0, count: n + 1)
+
+        for i in (0..<n).reversed() {
+            for j in 0...i {
+                dp[j] = min(dp[j], dp[j + 1]) + triangle[i][j]
+            }
+        }
+
+        return dp[0]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 100. \344\270\211\350\247\222\345\275\242\344\270\255\346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/Solution.swift" "b/lcof2/\345\211\221\346\214\207 Offer II 100. \344\270\211\350\247\222\345\275\242\344\270\255\346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/Solution.swift"
new file mode 100644
index 0000000000000..2aa79db08afb9
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 100. \344\270\211\350\247\222\345\275\242\344\270\255\346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/Solution.swift"	
@@ -0,0 +1,14 @@
+class Solution {
+    func minimumTotal(_ triangle: [[Int]]) -> Int {
+        let n = triangle.count
+        var dp = Array(repeating: 0, count: n + 1)
+        
+        for i in (0..<n).reversed() {
+            for j in 0...i {
+                dp[j] = min(dp[j], dp[j + 1]) + triangle[i][j]
+            }
+        }
+        
+        return dp[0]
+    }
+}
\ No newline at end of file