Search a 2D Matrix 2021-07-08 06:59
public boolean searchMatrix(int[][] matrix, int target) {
int left = 0;
int right = matrix.length * matrix[0].length - 1;
while (left <= right) {
int mid = (left + right) / 2;
int value = matrix[mid / matrix[0].length][mid % matrix[0].length];
if (value == target) {
return true;
}
if (value > target) {
right = mid - 1;
} else {
left = mid + 1;
}
}
return false;
}
| Runtime | Memory |
|---|---|
| 0 ms | 37.6 MB |
EOF