74.搜索二维矩
题目链接
https://leetcode.cn/problems/search-a-2d-matrix/
核心代码(java)
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
int left = 0,right = matrix.length;
//如果target小于第一个数或者大于最后一个数,直接返回false;
if(target<matrix[0][0]||target>matrix[right - 1][matrix[right-1].length - 1]){
return false;
}
//如果target在矩阵最大数值与最小数值之间;
for(int i = 0;i < matrix.length;i++){
//如果大于等于第i行第0个同时小于等于第i行最后一个数;
if(target <= matrix[i][matrix[i].length-1]&&target>=matrix[i][0]){
//二分查找与targe相等的数值;
left = 0;
right = matrix[i].length - 1;
while(left <= right){
int mid = left + (right - left)/2;
if(matrix[i][mid] > target){
//中间数值大于目标值;
right = mid - 1;
}
else if(matrix[i][mid]<target){
//中间数值小于目标值;
left = mid + 1;
}
else{
//如果等于目标值,返回true;
return true;
}
}
return false;
}
}
return false;
}
}