剑指offer-二维数组中的查找

 1 public boolean Find(int target, int [][] array) {//数组 查找 my
 2         if(null==array||0==array.length||0==array[0].length){
 3             return false;
 4         }
 5         int i = array.length-1;
 6         int j =0;
 7         while(i>=0&&j<array[0].length){
 8             if(array[i][j]==target){
 9                 return true;
10             }
11             else if(array[i][j]>target){
12                 i--;
13             }
14             else{
15                 j++;
16             }
17         }
18         return false;
19     }