240. Search a 2D Matrix II
Medium
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.
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.
题意
在一个二维数组中查询一个数字是否存在。二维数组的每行升序排列,每列升序排列,但是各行和格列之间没有绝对大小关系。
思路
分治,借鉴二分查找的思想,在这里,每次只能淘汰近似1/4的数据(只是近似,并不是真的1/4)
如下图所示,如果target小于矩阵中的(x, y)处的元素,则右下角的矩形肯定不会出现target
例如上面例子的二维数组,如果target = 7,当x = 2, y = 2时,target < matrix[2][2] = 9, 则以(3, 3)和(4, 4)为对角的矩阵中的元素一定也比target大,据此target只可能出现在剩下的部分再扣除matrix第2行第2列右方以及第2列第2行下方。
假设矩阵中总的元素个数为n, 则该分治算法的递推式近似为
T(n) = 3 * T(n/4) + O(1)
根据主定理,T(n) = O(n^log4(3))
代码
class Solution {
private boolean recuSearch(int[][] matrix, int target, int lx, int ly, int rx, int ry) {
if (lx < 0 || ly < 0 || rx >= matrix.length || ry >= matrix[0].length || rx < lx || ry < ly) {
return false;
}
if (lx == rx && ly == ry) {
return target == matrix[lx][ly];
}
int mx = (lx + rx) / 2, my = (ly + ry) / 2, val = matrix[mx][my];
if (val == target) {
return true;
} else if (val > target) {
return recuSearch(matrix, target, lx, my+1, mx-1, ry) || recuSearch(matrix, target, mx+1, ly, rx, my-1) || recuSearch(matrix, target, lx, ly, mx, my) ;
} else {
return recuSearch(matrix, target, mx+1, my+1, rx, ry) || recuSearch(matrix, target, lx, my+1, mx, ry) || recuSearch(matrix, target, mx+1, ly, rx, my);
}
}
public boolean searchMatrix(int[][] matrix, int target) {
int m = matrix.length;
if (m == 0) {
return false;
}
int n = matrix[0].length;
if (n == 0) {
return false;
}
return recuSearch(matrix, target, 0, 0, m-1, n-1);
}
}