Java 二维数组查找

class ArrayIndex
{
public static void main(String[] args)
{
int[][] arr  = {{1,2,3,4,5},{2,6,8,9,10},{4,8,12,13,15},{7,9,15,20,21}};
ArrayIndex arrIndex = new ArrayIndex();
boolean b1 = arrIndex.ArrayIndex(arr,10);
boolean b2 = arrIndex.ArrayIndex2(arr,10);
System.out.println(b1);
System.out.println(b2);

}
//最基础的方法，遍历查询
public boolean ArrayIndex(int[][] arr,int num)
{
boolean found = false;
if(arr != null)
{
for(int i =0;i < arr.length;i++)
  {
for(int j =0;j<arr[i].length;j++)
{
if(arr[i][j] == num)
{
found = true;
return true;

}
}
  }
}

return false;
}

//减少循环次数，从每一行最后一个数开始判断，由于数组每行、每列从小到大排列
//如果num > arr[i][j],那此数左边的都不需要判断了，直接到下一行
public boolean ArrayIndex2(int[][] arr,int num)
{
boolean found = false;
if(arr !=null)
{
for(int i = 0 ;i < arr.length ;i++)
 {
for(int j =arr[i].length -1;j>=0;j--)
{
if(arr[i][j] == num)
{
found = true;
return found;
}else if(arr[i][j] < num )
{
break;
}
}
 }
}

return found;
}


//假设二维数组每行列数相同的情况下
public boolean ArrayIndex3(int[][] arr,int num)
{ 
   boolean found = false;
int rows =0 ;
int cols = arr[0].length-1;
while(arr!= null && rows < arr.length && cols >=0)
{
if(arr[rows][cols] == num)
{
found = true;
break;
}else if(arr[rows][cols] < num)
{
rows++;
}else
{
cols--;
}
}

return found;


}

}