Search a 2D Matrix

Medium~20 min

You are given an m x n integer matrix matrix with the following 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 with O(log(m * n)) time complexity.

Examples

Example 1
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: true
Explanation: 3 is found in the first row.
Example 2
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: false
Explanation: 13 does not appear in the matrix.

Constraints

  • m == matrix.length
  • n == matrix[i].length
  • 1 <= m, n <= 100
  • -10^4 <= matrix[i][j], target <= 10^4
  • Expected time complexity: O(log(m * n))
Code
Ctrl+EnterRun|Ctrl+⇧+EnterSubmit
Output

Run your code to see results

Use Cmd+Enter to run