先去除不符合的列,再去除不符合的行,直到遍历完
public class Solution {
public boolean Find(int target, int [][] array) {
for(int i = array.length-1; i >= 0; i--){
if(array[i].length < 1){
return false;
}
if(array[i][0] > target){
continue;
}
for(int j = 0; j < array[i].length; j++){
if(array[i][j] == target){
return true;
}
if(array[i][j] < target){
continue;
}
}
}
return false;
}
}