leetcode(数组) --- JavaScript ---二维数组的查找_官方的螃蟹走法

var findnumin2dArray = function (matrix, target){
    if (matrix.length==0 || matrix[0].length==0){
        return false;
    }
    const maxrows = matrix.length - 1;
    const maxcols = matrix[0].length - 1;
    let row = maxrows, col = 0;
    while (row>=0 && col<=maxcols){
        if (target > matrix[row][col]){
            col++;
        } else if(target < matrix[row][col]){
            row--;
        }else {
            return true;
        }
    }
    return false;
}

console.log(findnumin2dArray([
    [1,   4,  7, 11, 15],
    [2,   5,  8, 12, 19],
    [3,   6,  9, 16, 22],
    [10, 13, 14, 17, 24],
    [18, 21, 23, 26, 30]
],5));