Skip to content

74. Search A 2d Matrix

Array Binary Search Matrix

Problem - Search A 2d Matrix

Medium

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

Solutions

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        m, n = len(matrix), len(matrix[0])
        left, right = 0, m * n - 1

        while right > left:
            mid = (left + right) // 2
            val, remain = divmod(mid, n)
            if matrix[val][remain] >= target:
                right = mid
            else:
                left = mid + 1

        return matrix[left // n][left % n] == target

Submission Stats:

  • Runtime: 0 ms (100.00%)
  • Memory: 18.2 MB (72.60%)