feat: add swift implementation to lcci problem: No.10.03 (#2713)

Author: klever34

lcci/10.03.Search Rotate Array/README.md

@@ -187,6 +187,40 @@ function search(arr: number[], target: number): number {
 }
 ```
 
+```swift
+class Solution {
+    func search(_ arr: [Int], _ target: Int) -> Int {
+        var l = 0
+        var r = arr.count - 1
+
+        while arr[l] == arr[r] && l < r {
+            r -= 1
+        }
+
+        while l < r {
+            let mid = (l + r) >> 1
+            if arr[mid] > arr[r] {
+                if arr[l] <= target && target <= arr[mid] {
+                    r = mid
+                } else {
+                    l = mid + 1
+                }
+            } else if arr[mid] < arr[r] {
+                if arr[mid] < target && target <= arr[r] {
+                    l = mid + 1
+                } else {
+                    r = mid
+                }
+            } else {
+                r -= 1
+            }
+        }
+
+        return arr[l] == target ? l : -1
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/10.03.Search Rotate Array/README_EN.md

@@ -193,6 +193,40 @@ function search(arr: number[], target: number): number {
 }
 ```
 
+```swift
+class Solution {
+    func search(_ arr: [Int], _ target: Int) -> Int {
+        var l = 0
+        var r = arr.count - 1
+
+        while arr[l] == arr[r] && l < r {
+            r -= 1
+        }
+
+        while l < r {
+            let mid = (l + r) >> 1
+            if arr[mid] > arr[r] {
+                if arr[l] <= target && target <= arr[mid] {
+                    r = mid
+                } else {
+                    l = mid + 1
+                }
+            } else if arr[mid] < arr[r] {
+                if arr[mid] < target && target <= arr[r] {
+                    l = mid + 1
+                } else {
+                    r = mid
+                }
+            } else {
+                r -= 1
+            }
+        }
+
+        return arr[l] == target ? l : -1
+    }
+}
+```
+
 <!-- tabs:end -->
 
 <!-- end -->

lcci/10.03.Search Rotate Array/Solution.swift

@@ -0,0 +1,31 @@
+class Solution {
+    func search(_ arr: [Int], _ target: Int) -> Int {
+        var l = 0
+        var r = arr.count - 1
+
+        while arr[l] == arr[r] && l < r {
+            r -= 1
+        }
+
+        while l < r {
+            let mid = (l + r) >> 1
+            if arr[mid] > arr[r] {
+                if arr[l] <= target && target <= arr[mid] {
+                    r = mid
+                } else {
+                    l = mid + 1
+                }
+            } else if arr[mid] < arr[r] {
+                if arr[mid] < target && target <= arr[r] {
+                    l = mid + 1
+                } else {
+                    r = mid
+                }
+            } else {
+                r -= 1
+            }
+        }
+
+        return arr[l] == target ? l : -1
+    }
+}