240. 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.
题意
矩阵从左到右从上到下递增,要求查找某个数是否在矩阵里
分治法
算法描述
从右上角的数num开始与target比较,i记行数,j记列数
- 若 num==target , 返回true
- 若 num>target , 说明target比这一列j的数中大于i的都要小,所以j–
- 若 num<target , 说明target比这一行i的数中小于j的都要大,所以i++
具体实现
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if (matrix.size() == 0) return false;
// get the size of matrix
int m = matrix.size();
int n = matrix[0].size();
// find the element
int i = 0, j = n-1;
while(i < m && j >= 0) {
if (matrix[i][j] == target)
return true;
else if (matrix[i][j] > target)
j--;
else
i++;
}
return false; // cannot find the target
}
};
复杂度
时间复杂度
O(m+n)
空间复杂度
O(n)