feat: add swift implementation to lcof2 problem: No.100 (doocs#3506)

Author: klever34

lcof2/剑指 Offer II 100. 三角形中最小路径之和/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 -->

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