Leetcode - 240 Search a 2D Matrix II (Medium)
题目描述:矩阵每行从左到右递增,每列从上到下递增,判断矩阵中是否有 target 元素。
[
[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.
解题思路:从右上角开始,利用二分查找的思想,如果比 target 大就向左查找,如果比 target 小就向下查找。
public boolean searchMatrix(int[][] matrix, int target) {
if (matrix == null || matrix.length == 0) return false;
int row = 0, col = matrix[0].length - 1;
while (row < matrix.length && col >= 0) {
if (matrix[row][col] == target) {
return true;
} else if(matrix[row][col] > target) {
col -= 1;
} else {
row += 1;
}
}
return false;
}