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 in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
For example,
Consider the following matrix:
[ [1, 4, 7, 11, 15], [2, 5, 8, 12, 19], [3, 6, 9, 16, 22], [10, 13, 14, 17, 24], [18, 21, 23, 26, 30] ]
Given target = 5
, return true
.
Given target = 20
, return false
.
Show Similar Problems
在一个矩阵中查找指定的值,判断这个值在矩阵中是否存在。
可以使用二分法,初始设置两个下标指(一个行标号,一个列标号)向第一行的最后一个元素,如果当前值比target大,那么列标号减1,如果比当前值小,那么行标号加1,如果找到这个target,返回true,如果这两个标号超出了矩阵的表示范围,表示这个矩阵中不存在这个target,返回false。
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int width,height;
height=matrix.size();
width=matrix[0].size();
int row=0;//记录行号
int col=width-1;//记录列号
while(row>=0&&row<height&&col>=0&&col<width)
{
if(matrix[row][col]>target)
col--;
else if(matrix[row][col]<target)
row++;
else
return true;
}
return false;
}
};