class Solution {
public boolean searchArray(int[][] array, int target) {
if(array.length == 0) {
return false;
}
int x = 0;
int y = array[0].length - 1;
while(x < array.length && y >= 0) {
if(array[x][y] == target) {
return true;
}else if(array[x][y] > target) {
y–;
}else {
x++;
}
}
return false;
}
}
1.注意数据特点
2.右上方为起点