题目描述
在一个二维数组中,每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。
解法1:对每一行进行二分,找到就结束
解法2:首先我们选择从左下角开始搜寻,(为什么不从左上角开始搜寻,左上角向右和向下都是递增,那么对于一个点,对于向右和向下会产生一个岔路;如果我们选择从左下脚开始搜寻的话,如果大于就向右,如果小于就向下)。
import java.util.Scanner;
public class Main {
public static boolean Find(int[][] array, int target) {
for (int i = 0; i < array.length; i++) {
int left = 0, rigth = array[i].length - 1;
while (left <= rigth) {
int mid = (left + rigth) / 2;
if (target < array[i][mid]) {
rigth = mid - 1;
} else if (target > array[i][mid]) {
left = mid + 1;
} else {
return true;
}
}
}
return false;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int n = in.nextInt();
int m = in.nextInt();
int[][] array = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
array[i][j] = in.nextInt();
}
}
int k = in.nextInt();
System.out.println(Find(array, k));
}
in.close();
}
}
import java.util.Scanner;
public class Main {
public static boolean Find(int[][] array, int target) {
int len = array.length - 1;
int i = 0;
while ((len >= 0) && (i < array[0].length)) {
if (array[len][i] > target) {
len--;
} else if (array[len][i] < target) {
i++;
} else {
return true;
}
}
return false;
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int n = in.nextInt();
int m = in.nextInt();
int[][] array = new int[n][m];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
array[i][j] = in.nextInt();
}
}
int k = in.nextInt();
System.out.println(Find(array, k));
}
in.close();
}
}