二维数组中的查找_01

public boolean Find(int target, int [][] array) {
        //以右上角为起点检索
        int height=array.length;
        int width=array[0].length;
        if (array==null||height<1||width<1){
            return false;
        }
        int x=0,y=width-1;
        int currNum;
        while (x<=height-1&&y>=0){
            currNum=array[x][y];
            if (currNum==target){
                return true;
            }else if (currNum>target){
                y--;
            }else if (currNum<target){
                x++;
            }
        }
        return false;
    }