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.
For 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.
思路:由于矩阵的特殊性质,我们从右上角的位置开始走,如果数值小于target,则向左走;如果数值大于target,则向下走;如果相等,则直接返回。
public boolean searchMatrix(int[][] matrix, int target) {
if (matrix == null || matrix.length == 0 || matrix[0].length == 0) return false;
int index1 = 0, index2 = matrix[0].length - 1;
while (index1 < matrix.length && index2 >= 0) {
if (matrix[index1][index2] == target) return true;
else if (matrix[index1][index2] > target) index2--;
else index1++;
}
return false;
}