编写一个高效的算法来搜索 m x n 矩阵 matrix 中的一个目标值 target。该矩阵具有以下特性:
每行的元素从左到右升序排列。
每列的元素从上到下升序排列。
示例:
现有矩阵 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]
]
给定 target = 5,返回 true。
给定 target = 20,返回 false。
if(matrix.length == 0)
return false;
int m = matrix.length;
int n = matrix[0].length;
int i = 0,j = n - 1;
while(i < m && j >= 0) {
if(matrix[i][j] == target)
return true;
else if(matrix[i][j] > target)
--j;
else
++i;
}
return false;
}
package Leetcode;
public class 搜索二维矩阵 {
public static boolean searchMatrix(int[][] matrix, int target) {
if (matrix.length == 0)
return false;
int m = matrix.length;
int n = matrix[0].length;
int i = 0, j = n - 1;
while (i < m && j >= 0) {
if (matrix[i][j] == target)
return true;
else if (matrix[i][j] > target)
--j;
else
++i;
}
return false;
}
public static void main(String[] args) {
int[][] 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}};
System.out.println(searchMatrix(matrix,5));
System.out.println(searchMatrix(matrix,20));
}
}