Search a 2D Matrix - LeetCode : Swift

Search a 2D Matrix - LeetCode

You are given an m x n integer matrix matrix with the following two properties:

• Each row is sorted in non-decreasing order.
• The first integer of each row is greater than the last integer of the previous row.

Given an integer target, return true if target is in matrix or false otherwise.

You must write a solution in O(log(m * n)) time complexity.

Example 1:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: true

Example 2:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: false

Constraints:

• m == matrix.length
• n == matrix[i].length
• 1 <= m, n <= 100
• -104 <= matrix[i][j], target <= 104

Solution

class Solution {
    func searchMatrix(_ matrix: [[Int]], _ target: Int) -> Bool {
        var array = matrix.flatMap { $0}
        var low = 0
        var mid = 0
        var high = array.count - 1

        while(low <= high) {
            mid = (low + high) / 2
            if array[mid] == target {
                return true
            } else if array[mid] < target {
                low = mid + 1
            } else if array[mid] > target {
                high = mid - 1
            }
        }
        return false
    }
}