每天一道剑指offer-二维数组中的查找

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