LeetCode 74. 搜索二维矩阵 -> 竖着二分一次, 横着二分一次
原题链接
中等
作者:
JustDoIt11
,
2023-10-31 20:33:56
,
所有人可见
,
阅读 64
package leetcode;
public class lec74 {
public boolean searchMatrix(int[][] matrix, int target) {
int l = 0, r = matrix.length - 1;
while (l < r) {
int mid = l + r + 1 >> 1;
if (matrix[mid][0] <= target) l = mid;
else r = mid - 1;
}
int now = l;
l = 0; r = matrix[now].length - 1;
while (l < r) {
int mid = l + r + 1 >> 1;
if (matrix[now][mid] <= target) l = mid;
else r = mid - 1;
}
return matrix[now][l] == target;
}
}