feat: add swift implementation to lcci problem: No.16.11 (doocs#2743)

Author: klever34

lcci/16.11.Diving Board/README.md

@@ -112,6 +112,25 @@ function divingBoard(shorter: number, longer: number, k: number): number[] {
 }
 ```
 
+```swift
+class Solution {
+    func divingBoard(_ shorter: Int, _ longer: Int, _ k: Int) -> [Int] {
+        if k == 0 {
+            return []
+        }
+        if shorter == longer {
+            return [shorter * k]
+        }
+        
+        var ans = [Int](repeating: 0, count: k + 1)
+        for i in 0...k {
+            ans[i] = longer * i + shorter * (k - i)
+        }
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/16.11.Diving Board/README_EN.md

@@ -122,6 +122,25 @@ function divingBoard(shorter: number, longer: number, k: number): number[] {
 }
 ```
 
+```swift
+class Solution {
+    func divingBoard(_ shorter: Int, _ longer: Int, _ k: Int) -> [Int] {
+        if k == 0 {
+            return []
+        }
+        if shorter == longer {
+            return [shorter * k]
+        }
+        
+        var ans = [Int](repeating: 0, count: k + 1)
+        for i in 0...k {
+            ans[i] = longer * i + shorter * (k - i)
+        }
+        return ans
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/16.11.Diving Board/Solution.swift

@@ -0,0 +1,16 @@
+class Solution {
+    func divingBoard(_ shorter: Int, _ longer: Int, _ k: Int) -> [Int] {
+        if k == 0 {
+            return []
+        }
+        if shorter == longer {
+            return [shorter * k]
+        }
+        
+        var ans = [Int](repeating: 0, count: k + 1)
+        for i in 0...k {
+            ans[i] = longer * i + shorter * (k - i)
+        }
+        return ans
+    }
+}