[LeetCode] Search a 2D Matrix II
题目描述
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.
分析
首先通过对列进行比较确定目标可能在的列,搜索目标定为大于该列第一个数,因此从右往左检查,然后再对行进行检查。如果目标小于检查的数,那么可以确定目标在检查的数的左方,那么向左缩小搜索范围,如果目标大于检查的数,那么可以确定在检查的数的下方,重复检查,最后确定目标是否在矩阵中。
代码
class Solution {
public:
bool searchMatrix(vector<vector<int> >& matrix, int target) {
if(matrix.size() == 0) return false;
int i, j, rows = matrix.size(), cols = matrix[0].size();
i = 0;
j = cols - 1;
while(i < rows && j >= 0) {
if(matrix[i][j] == target) return true;
else if(matrix[i][j] > target) j--;
else i++;
}
return false;
}
};