题解 | #二维数组中的查找#

public boolean Find(int target, int [][] array) {
        int r = 0;
        int c = array[0].length-1;
        while(r<array.length&&c>=0){
            if(array[r][c]>target){
                c--;
            }else if(array[r][c]<target){
                r++;
            }else{
                return true;
            }
        }
        return false;
    }