剑指Offer Java版 二维数组的查找

public class Solution {
    public boolean Find(int target, int [][] array) {
        for(int a = 0 ;a<array.length;a++){
        for(int b = 0 ;b<array[a].length;b++){
            if(array[a][b]==target){
                return true;
            }
        }  
    }  
    return false;
    }
}

public class Solution {
    public boolean Find(int target, int [][] array) {
        int row=array[0].length;//lie
	int col=array.length;//hang
	int hang=0;
	while(hang<col&&row>0){
	    if(array[hang][row-1]>target){
		row=row-1;
	    }else if(array[hang][row-1]<target){
			hang=hang+1;
	    }else if(array[hang][row-1]==target){
			return true;
	    }
	}
		        return false;
    }
}