题目:
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
.
本题要求我们判断在给定的矩阵当中,能否找到给定的整数。矩阵排列的规律是,同一行中,从左到右数字依次递增,同一列中,从上到下数字一次递增。根据分治的思想,先考察矩阵右上角的元素,如果这个元素比给定值大,则在同一列中都不可能找到与给定值相等的元素,如果这个元素比给定值小,则在同一行中都不可能找到与给定值相等的元素,因此在矩阵的搜索空间可以减少一列或者一行。这样一步一步地减小搜索空间,知道最后得到最终的结果。
程序:
bool searchMatrix(int** matrix, int matrixRowSize, int matrixColSize, int target)
{
int i = 0;
int j = matrixColSize - 1;
while(i < matrixRowSize&&j >= 0)
{
if(matrix[i][j] == target)
return true;
else if(matrix[i][j] > target)
j--;
else
i++;
}
return false;
}