# 74 Search a 2D Matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous row.
For example,

Consider the following matrix:

[
[1,   3,  5,  7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
Given target = 3, return true.

public class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if(matrix == null || matrix.length == 0)
return false;
int high = matrix.length - 1;
int low = 0;
int mid = 0;
while(low <= high) {
mid = (low + high) / 2;
if(matrix[mid][0] == target)
return true;
else if(matrix[mid][0] > target)
high = mid - 1;
else
low = mid + 1;
}
int row = mid;
if(matrix[mid][0] > target) {
if(mid > 0)
row = mid - 1;
else
return false;
}
low = 1;
high = matrix[0].length - 1;
while(low <= high) {
mid = (low + high) / 2;
if(matrix[row][mid] == target)
return true;
else if(matrix[row][mid] > target)
high = mid - 1;
else
low = mid + 1;
}
return false;
}
}
134 / 134 test cases passed.
Status: Accepted
Runtime: 1 ms