Leetcode 74. Search a 2D Matrix

public class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int row = matrix.length;
if (row == 0) return false;

int col = matrix[0].length;
if (col == 0) return false;

int low = 0, high = row*col-1, mid = 0;
while (low <= high) {
mid = (low+high)/2;
if (target == matrix[mid/col][mid%col]) return true;
else if (target > matrix[mid/col][mid%col]) low = mid + 1;
else high = mid - 1;
}
return false;
}
}