public boolean Find(int target, int[][] array) {
if (array == null || array.length == 0 || array[0].length == 0) {
return false;
}
int rows = array.length;
int cols = array[0].length;
int row = 0;
int col = cols - 1;
while (row < rows && col >= 0) {
int num = array[row][col];
if (num == target) {
return true;
} else if (num > target) {
col--;
} else if (num < target) {
row++;
}
}
return false;
}
二维数组中的查找
最新推荐文章于 2025-07-08 11:49:15 发布