题目:
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.
Example 1:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 3
Output: true
Example 2:
Input:
matrix = [
[1, 3, 5, 7],
[10, 11, 16, 20],
[23, 30, 34, 50]
]
target = 13
Output: false
解答:
题目整理思路比较简单,找到目标值所在的行,然后再通过二分法找到具体的位置即可。
- 用 i 表示目标值所在的行数。遍历二维数组,将目标值与每行的首位数字进行比较。若相等直接返回 true,若在中间表示目标值在当前第 i 行,break 退出遍历
- 若目标值未找到范围行,则此时 i=m 退出遍历,说明不存在目标值,直接 return false
- 找到当前行 i 后,再通过二分法进行查找
class Solution {
public boolean searchMatrix (int[][] matrix, int target) {
if (matrix.length ==0 || matrix[0].length == 0) {
return false;
}
int m = matrix.length;
int n = matrix[0].length;
int i;
for (i = 0; i < m; i++) {
if (target == matrix[i][0] || target == matrix[i][n-1]) {
return true;
}
if (target > matrix[i][0] && target < matrix[i][n-1]) {
break;
}
}
if(i==m) return false;
int[] list = new int[n];
int start = 0;
int end = n;
list = matrix[i];
while (start <= end) {
int mid = (start + end) / 2;
if (list[mid] == target) {
return true;
} else if (list[mid] > target) {
end = mid - 1;
} else {
start = mid + 1;
}
}
return false;
}
}
题目思路比较简单,但一定要注意各种特殊情况的处理,否则起初导致多次提交失败
- 如果
if (matrix.length ==0 || matrix[0].length == 0)
,则直接 return false - 起初一直没考虑到,如果目标值不在每一行的范围内,遍历没有找到目标行的情况。此时遍历到 i=m 时退出循环,所以要进行
if(i==m) return false;
,否则会 Runtime Error