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
.
难度:medium
题目大意为在从左到右上到下为递增的矩阵中查找给的数字。
解题思路
可以用分治法来求
选右上角的数字来与target比较,可以缩减行和列数。这样就可以把一个m×n矩阵变成小矩阵,来分而治之。
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if (matrix.empty()) return false;
int row = matrix.size(), col = matrix[0].size();
int i = 0, j = col - 1;
while (i < row && j >= 0) {
if (target == matrix[i][j]) return true;
else if (matrix[i][j] > target) j--;
else i++;
}
return false;
}
};