feat: add swift implementation to lcci problem: No.10.01(#2711)

Author: klever34

lcci/10.01.Sorted Merge/README.md

@@ -145,6 +145,23 @@ var merge = function (A, m, B, n) {
 };
 ```
 
+```swift
+class Solution {
+    func merge(_ A: inout [Int], _ m: Int, _ B: [Int], _ n: Int) {
+        var i = m - 1, j = n - 1
+        for k in stride(from: m + n - 1, through: 0, by: -1) {
+            if j < 0 || (i >= 0 && A[i] > B[j]) {
+                A[k] = A[i]
+                i -= 1
+            } else {
+                A[k] = B[j]
+                j -= 1
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/10.01.Sorted Merge/README_EN.md

@@ -144,6 +144,23 @@ var merge = function (A, m, B, n) {
 };
 ```
 
+```swift
+class Solution {
+    func merge(_ A: inout [Int], _ m: Int, _ B: [Int], _ n: Int) {
+        var i = m - 1, j = n - 1
+        for k in stride(from: m + n - 1, through: 0, by: -1) {
+            if j < 0 || (i >= 0 && A[i] > B[j]) {
+                A[k] = A[i]
+                i -= 1
+            } else {
+                A[k] = B[j]
+                j -= 1
+            }
+        }
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/10.01.Sorted Merge/Solution.swift

@@ -0,0 +1,14 @@
+class Solution {
+    func merge(_ A: inout [Int], _ m: Int, _ B: [Int], _ n: Int) {
+        var i = m - 1, j = n - 1
+        for k in stride(from: m + n - 1, through: 0, by: -1) {
+            if j < 0 || (i >= 0 && A[i] > B[j]) {
+                A[k] = A[i]
+                i -= 1
+            } else {
+                A[k] = B[j]
+                j -= 1
+            }
+        }
+    }
+}