算法思想:
代码如下:
public class Demo3 {
static String newS;
static int ages[]=new int[]{1,2,8,9,2,4,9,12,4,7,10,13,6,8,11,15};
static boolean findItem(int ages[],int rows,int columns,int number)
{
boolean find=false;
if(ages!=null && rows>0 && columns>0)
{
int row=0;
int column=columns-1;
while(row < rows && column >= 0)
{
if(ages[row*columns+column] ==number)
{
find=true;
break;
}
else if(ages[row*columns+column] >number)
{
column--;
}
else
{
++row;
}
}
}
return find;
}
public static void main(String[] args) {
boolean flag=findItem(ages, 4, 4, 3);
System.out.println(flag);
}
}