public class Solution {
public boolean Find(int target, int [][] array) {
int rows = array.length - 1;
int colums = array[0].length - 1;
int i = rows, j = 0;
while(i >= 0 && j <= colums){
if(target > array[i][j]){
j +=1;
}else if(target < array[i][j]){
i -=1;
}else{
return true;
}
}
return false;
}
}