原题地址:https://leetcode-cn.com/problems/search-a-2d-matrix/submissions/
题目描述:
编写一个高效的算法来判断 m x n 矩阵中,是否存在一个目标值。该矩阵具有如下特性:
每行中的整数从左到右按升序排列。
每行的第一个整数大于前一行的最后一个整数。
示例 1:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
输出: true
示例 2:
输入:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
输出: false
解题方案:
看到题目第一反应是把二维矩阵存到一维矩阵里,但是想了一下这不是遍历嘛时间复杂度太高了,所以就想先二分查第一列里小于target的最大值,然后再在这一行二分,由于当数组中值小于target时可能是想找的值,所以此时low=mid,结果为了处理特殊情况还加了不少判断,结果在看题解的时候发现可以直接用处理下标的方式把二维数组看作一维,完全忘了这个方法。。。
代码:
class Solution {
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;
int low = 0, high = m - 1;
int mid = 0, row = 0;
while(low <= high)
{
mid = (low + high) / 2;
if(matrix[mid][0] == target)
return true;
else if(matrix[mid][0] > target)
high = mid - 1;
else
{
low = mid;
if(high - low == 1 || high == low)
{
if(matrix[high][0] == target)
return true;
else if(matrix[high][0] > target)
{
row = low;
break;
}
else
{
row = high;
break;
}
}
}
}
System.out.println(low);
low = 0;
high = n - 1;
while(low <= high)
{
mid = (low + high) / 2;
if(matrix[row][mid] == target)
return true;
else if(matrix[row][mid] > target)
high = mid - 1;
else
low = mid + 1;
}
return false;
}
}
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if(matrix.length == 0 || matrix[0].length == 0)
return false;
int m = matrix.length, n = matrix[0].length;
int low = 0, high = m * n - 1;
int mid;
while(low < high)
{
mid = (low + high) / 2;
if(matrix[mid / n][mid % n] < target)
low = mid + 1;
else
high = mid;
}
return matrix[low / n][low % n] == target;
}
}