二维数组中的查找代码

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