feat: add swift implementation to lcci problem: No.10.09

lcci/10.09.Sorted Matrix Search/README.md

@@ -177,6 +177,37 @@ public class Solution {
 }
 ```
 
+```swift
+class Solution {
+    func searchMatrix(_ matrix: [[Int]], _ target: Int) -> Bool {
+        for row in matrix {
+            if binarySearch(row, target) {
+                return true
+            }
+        }
+        return false
+    }
+
+    private func binarySearch(_ array: [Int], _ target: Int) -> Bool {
+        var left = 0
+        var right = array.count - 1
+
+        while left <= right {
+            let mid = left + (right - left) / 2
+            if array[mid] == target {
+                return true
+            } else if array[mid] < target {
+                left = mid + 1
+            } else {
+                right = mid - 1
+            }
+        }
+
+        return false
+    }
+}
+```
+
 <!-- tabs:end -->
 
 ### 方法二：从左下角或右上角搜索

lcci/10.09.Sorted Matrix Search/README_EN.md

@@ -185,6 +185,37 @@ public class Solution {
 }
 ```
 
+```swift
+class Solution {
+    func searchMatrix(_ matrix: [[Int]], _ target: Int) -> Bool {
+        for row in matrix {
+            if binarySearch(row, target) {
+                return true
+            }
+        }
+        return false
+    }
+
+    private func binarySearch(_ array: [Int], _ target: Int) -> Bool {
+        var left = 0
+        var right = array.count - 1
+
+        while left <= right {
+            let mid = left + (right - left) / 2
+            if array[mid] == target {
+                return true
+            } else if array[mid] < target {
+                left = mid + 1
+            } else {
+                right = mid - 1
+            }
+        }
+
+        return false
+    }
+}
+```
+
 <!-- tabs:end -->
 
 ### Solution 2: Search from the Bottom Left or Top Right

lcci/10.09.Sorted Matrix Search/Solution.swift

@@ -0,0 +1,28 @@
+class Solution {
+    func searchMatrix(_ matrix: [[Int]], _ target: Int) -> Bool {
+        for row in matrix {
+            if binarySearch(row, target) {
+                return true
+            }
+        }
+        return false
+    }
+
+    private func binarySearch(_ array: [Int], _ target: Int) -> Bool {
+        var left = 0
+        var right = array.count - 1
+
+        while left <= right {
+            let mid = left + (right - left) / 2
+            if array[mid] == target {
+                return true
+            } else if array[mid] < target {
+                left = mid + 1
+            } else {
+                right = mid - 1
+            }
+        }
+
+        return false
+    }
+}