feat: add swift implementation to lcof problem: No.11 (#2858)

Author: klever34

lcof/面试题11. 旋转数组的最小数字/README.md

@@ -206,6 +206,28 @@ public class Solution {
 }
 ```
 
+#### Swift
+
+```swift
+class Solution {
+    func minArray(_ numbers: [Int]) -> Int {
+        var l = 0
+        var r = numbers.count - 1
+        while l < r {
+            let m = (l + r) / 2
+            if numbers[m] > numbers[r] {
+                l = m + 1
+            } else if numbers[m] < numbers[r] {
+                r = m
+            } else {
+                r -= 1
+            }
+        }
+        return numbers[l]
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

lcof/面试题11. 旋转数组的最小数字/Solution.swift

@@ -0,0 +1,17 @@
+class Solution {
+    func minArray(_ numbers: [Int]) -> Int {
+        var l = 0
+        var r = numbers.count - 1
+        while l < r {
+            let m = (l + r) / 2
+            if numbers[m] > numbers[r] {
+                l = m + 1
+            } else if numbers[m] < numbers[r] {
+                r = m
+            } else {
+                r -= 1
+            }
+        }
+        return numbers[l]
+    }
+}