https://leetcode.com/problems/search-a-2d-matrix/
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 from left to right.
- The first integer of each row is greater than the last integer of the previous row.
For example,
Consider the following matrix:
[ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ]
Given target = 3
, return true
.
这里用到的就是二分法的一个性质,即搜索完后,left值要么是target本身,要么是比target大的最小值。
另外,也可以用right值,即搜索完的right是target本身或者比target小的最大值。
代码入下:
public boolean searchMatrix(int[][] matrix, int target) {
int row = matrix.length;
int col = matrix[0].length;
int l = 0, r = row-1;
while(l<=r){
int mid= (l+r)/2;
if(matrix[mid][0]==target) return true;
else if(matrix[mid][0]<target) l=mid+1;
else r = mid-1;
}
//search A[l-1] row
int trow = l-1; //or trow = r;
if(trow<0) return false;
l=0;
r = col-1;
while(l<=r){
int mid = (l+r)/2;
if(matrix[trow][mid]==target) return true;
else if(matrix[trow][mid]<target) l=mid+1;
else r = mid-1;
}
return false;
}
如果遍历解法,时间复杂度O(mn),这里用的binary search解法时间复杂度O(lgm*lgn)