题解 | #在行列都排好序的矩阵中找指定的数#

// 语言环境
const readline = require('readline');
const rl = readline.createInterface({
    input: process.stdin,
    output: process.stdout
});
let numberOfLines = 0;
const inputs = [];
rl.on('line',  line => {
    numberOfLines++;
    const data = line.split(' ').map(value => parseInt(value));
    inputs.push(data);
    if(inputs.length === inputs[0][0] + 1) {
        const arr = inputs.filter((value, index) => index !== 0);
        const value = inputs[0][2] ;
        const isContain = deal(arr, value);
        const output = isContain ? 'Yes' : 'No';
        console.log(output)
    }
});

// 具体实现
function deal(arr, value) {
    // arr: 矩阵（N行M列数组）
    // value: 要查找的数
    return arr.some(line => {
        return line.some(item => item === value);
    });
}