public class MethodDemo{
public static void main(String[] args){
int[][] arr={ {1,2,8,9},{2,4,9,12},{4,7,10,13},{6,8,11,15}};
//boolean result = FindCount1(arr,13);
boolean result = FindCount2(arr,4,4,5);
System.out.println(result);
}
//思路一:遍历该数组,当数组中某个值跟输入的整数相等时,即为所求,否则该数组中不存在。
public static boolean FindCount1(int[][] arr,int count){
boolean flag = false;
for(int x=0;x<arr.length;x++){
public static void main(String[] args){
int[][] arr={ {1,2,8,9},{2,4,9,12},{4,7,10,13},{6,8,11,15}};
//boolean result = FindCount1(arr,13);
boolean result = FindCount2(arr,4,4,5);
System.out.println(result);
}
//思路一:遍历该数组,当数组中某个值跟输入的整数相等时,即为所求,否则该数组中不存在。
public static boolean FindCount1(int[][] arr,int count){
boolean flag = false;
for(int x=0;x<arr.length;x++){