public class Solution {
public boolean Find(int [][] array,int target) {
int hang = array.length-1;
int lie = array[0].length-1;
if((hang!=0&&lie!=0)&&target>=array[0][0]&&target<=array[hang][lie]){
//在数组中寻找
for (int i=0;i<=hang;i++)
{
if (target>=array[i][0]&&target <=array[i][lie])
{
for(int j=0;j<=lie ;j++)
{
if (target==array[i][j])
return true;
}
}
}
}
return false;
}
}
剑指offer 二维数组查找
最新推荐文章于 2020-08-07 11:02:11 发布