74. 搜索二维矩阵

74. 搜索二维矩阵

if (brr[0] <= target && brr[brr.length - 1] >= target) { 遍历二维数组，如果找到了满足target在区间[brr[0],brr[1]]内,则查询target是否在数组内部，是则返回true，否则为false

return false 如果在遍历数组的循环体内找不到，则饭回false

var searchMatrix = function (arr, target) {
    var len = arr.length;
    for (var i = 0; i < len; i++) {
        var brr = arr[i]
        if (brr[0] <= target && brr[brr.length - 1] >= target) {
            return brr.includes(target)
        }
    }
    return false
};