3、二维数组的查找

public class Solution {
    public boolean Find(int [][] array,int target) {
        boolean isFound=false;
            int columnCount=array.length;
            int rowCount=array[0].length;
            if(array!=null&&columnCount!=0&&rowCount!=0){
                int currentRow=0;
                int currentColumn=columnCount-1;
                while(currentRow<rowCount&&currentColumn>=0){//循环迭代
                    if(array[currentRow][currentColumn]==target){//将右上角的元素与findValue比较
                        isFound=true;
                        break;
                    }else if(array[currentRow][currentColumn]>target){
                        currentColumn--;
                    }else{
                        currentRow++;
                    }
                }
            }
            return isFound;
    }
}