二维数组中的查找

public class Solution {
    public boolean Find(int target, int [][] array) {
        int y=0;
        int x=array.length-1;
        int row=array.length-1;
        int col=array[0].length-1;
        while((0<=x&&x<=col)&&(0<=y&&y<=row)){

            if(array[x][y]==target)
                return true;
            if(array[x][y]<target){
                y++;
               continue;
             }
            if(array[x][y]>target){
                x--;
               continue;
            }
        }
        return false;
    }
}