feat: add swift implementation to lcof2 problem: No.099 (doocs#3505)

Author: klever34

lcof2/剑指 Offer II 099. 最小路径之和/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 -->

lcof2/剑指 Offer II 099. 最小路径之和/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]
+    }
+}