feat: add swift implementation to lcci problem: No.16.16 (#2747)

Author: klever34

Diff for: lcci/16.16.Sub Sort/README.md

@@ -146,6 +146,34 @@ function subSort(array: number[]): number[] {
 }
 ```
 
+```swift
+class Solution {
+    func subSort(_ array: [Int]) -> [Int] {
+        let n = array.count
+        var mi = Int.max, mx = Int.min
+        var left = -1, right = -1
+
+        for i in 0..<n {
+            if array[i] < mx {
+                right = i
+            } else {
+                mx = array[i]
+            }
+        }
+
+        for i in stride(from: n - 1, through: 0, by: -1) {
+            if array[i] > mi {
+                left = i
+            } else {
+                mi = array[i]
+            }
+        }
+
+        return [left, right]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

Diff for: lcci/16.16.Sub Sort/README_EN.md

@@ -149,6 +149,34 @@ function subSort(array: number[]): number[] {
 }
 ```
 
+```swift
+class Solution {
+    func subSort(_ array: [Int]) -> [Int] {
+        let n = array.count
+        var mi = Int.max, mx = Int.min
+        var left = -1, right = -1
+
+        for i in 0..<n {
+            if array[i] < mx {
+                right = i
+            } else {
+                mx = array[i]
+            }
+        }
+
+        for i in stride(from: n - 1, through: 0, by: -1) {
+            if array[i] > mi {
+                left = i
+            } else {
+                mi = array[i]
+            }
+        }
+
+        return [left, right]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

Diff for: lcci/16.16.Sub Sort/Solution.swift

@@ -0,0 +1,25 @@
+class Solution {
+    func subSort(_ array: [Int]) -> [Int] {
+        let n = array.count
+        var mi = Int.max, mx = Int.min
+        var left = -1, right = -1
+
+        for i in 0..<n {
+            if array[i] < mx {
+                right = i
+            } else {
+                mx = array[i]
+            }
+        }
+
+        for i in stride(from: n - 1, through: 0, by: -1) {
+            if array[i] > mi {
+                left = i
+            } else {
+                mi = array[i]
+            }
+        }
+
+        return [left, right]
+    }
+}