两种解法

public class Find_1 {
    //solution 1 
    public boolean Find(int target, int [][] array) {
        for(int i=0;i<array.length();i++)
            for(int j=0;j<array[i].length;j++){
                if(array[i][j]==target)
                    return true;
            }
        return false;

    }
    //soulution2 use binary search
    public boolean Find1(int target, int [][] array) {
        for(int i=0;i<array.length;i++){
            if(binary_search(target,array[i]))
                return true;
        }
        return false;


    }
    public static boolean binary_search(int target,int []array){
        int low=0;
        int high=array.length-1;
        int mim=0;
        while(low<=high){
            mim=(low+high)/2;
            if(target==array[mim])
                return true;
            else if(target>array[mim])
                low=mim+1;
            else
                high=mim-1;
        }

    }

}