feat: add swift implementation to lcof2 problem: No.088 (doocs#3473)

Author: klever34

lcof2/剑指 Offer II 088. 爬楼梯的最少成本/README.md

@@ -141,6 +141,21 @@ function minCostClimbingStairs(cost: number[]): number {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func minCostClimbingStairs(_ cost: [Int]) -> Int {
+        let n = cost.count
+        var dp = Array(repeating: 0, count: n + 1)
+        for i in 2...n {
+            dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2])
+        }
+        return dp[n]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof2/剑指 Offer II 088. 爬楼梯的最少成本/Solution.swift

@@ -0,0 +1,10 @@
+class Solution {
+    func minCostClimbingStairs(_ cost: [Int]) -> Int {
+        let n = cost.count
+        var dp = Array(repeating: 0, count: n + 1)
+        for i in 2...n {
+            dp[i] = min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2])
+        }
+        return dp[n]
+    }
+}