diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 099. \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 099. \346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/README.md"
index af4b02afa7ef6..df546c0e221a5 100644
--- "a/lcof2/\345\211\221\346\214\207 Offer II 099. \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 099. \346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/README.md"	
@@ -202,6 +202,34 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func minPathSum(_ grid: [[Int]]) -> Int {
+        let m = grid.count
+        let n = grid[0].count
+        var dp = grid
+
+        for i in 1..<m {
+            dp[i][0] += dp[i-1][0]
+        }
+        
+        for j in 1..<n {
+            dp[0][j] += dp[0][j-1]
+        }
+        
+        for i in 1..<m {
+            for j in 1..<n {
+                dp[i][j] += min(dp[i-1][j], dp[i][j-1])
+            }
+        }
+        
+        return dp[m-1][n-1]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->
diff --git "a/lcof2/\345\211\221\346\214\207 Offer II 099. \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 099. \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..34197f086e1a2
--- /dev/null
+++ "b/lcof2/\345\211\221\346\214\207 Offer II 099. \346\234\200\345\260\217\350\267\257\345\276\204\344\271\213\345\222\214/Solution.swift"	
@@ -0,0 +1,23 @@
+class Solution {
+    func minPathSum(_ grid: [[Int]]) -> Int {
+        let m = grid.count
+        let n = grid[0].count
+        var dp = grid
+
+        for i in 1..<m {
+            dp[i][0] += dp[i-1][0]
+        }
+        
+        for j in 1..<n {
+            dp[0][j] += dp[0][j-1]
+        }
+        
+        for i in 1..<m {
+            for j in 1..<n {
+                dp[i][j] += min(dp[i-1][j], dp[i][j-1])
+            }
+        }
+        
+        return dp[m-1][n-1]
+    }
+}