2.二维数组中查找

最新推荐文章于 2024-09-21 10:02:17 发布

我就吃辣的

最新推荐文章于 2024-09-21 10:02:17 发布

阅读量77

点赞数

分类专栏：算法文章标签： leetcode

本文链接：https://blog.csdn.net/qq_43144059/article/details/112757531

版权

算法专栏收录该内容

5 篇文章 0 订阅

订阅专栏

2.二维数组中查找

找规律

/**
         * @param {number[][]} matrix
         * @param {number} target
         * @return {boolean}
         * 找规律,左下角
         * 当martix[i][j]>target,上走一步
         * 当martix[i][j]<target,右走一步
         */

        let matrix = [[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]]
        let target = 5;
        var findNumberIn2DArray = function (matrix, target) {
            let i = matrix.length - 1;
            let j = 0;
            while (i >= 0 && j < matrix[0].length) {
                if (matrix[i][j] > target) {
                    i--;
                } else if (matrix[i][j] < target) {
                    j++;
                } else {
                    return true;
                }
            }
            return false;
        };
        console.log(findNumberIn2DArray(matrix, target));

二分法

/**
         * @param {number[][]} matrix
         * @param {number} target
         * @return {boolean}
         * 二分法
         * 
         * 
         */
        let matrix = [[1, 1]]
        let target = 0;
        var findNumberIn2DArray = function (matrix, target) {
            if (matrix.length === 0 || matrix[0].length === 0) {
                return false;
            }
            let minL = Math.min(matrix.length, matrix[0].length);
            for (let i = 0; i < minL; i++) {
                if (search(matrix, target, i, true) || search(matrix, target, i, false)) {
                    return true;
                }
            }
            return false;
        };

        function search(matrix, target, start, isVertical) {
            let index = start;
            let end = isVertical === true ? matrix.length : matrix[0].length - 1;
            while (start <= end) {
                let mid = Math.floor((start + end) / 2);
                if (isVertical) {
                    if (matrix[mid][index] > target) {
                        end = mid - 1;
                    } else if (matrix[mid][index] < target) {
                        start = mid + 1;
                    } else {
                        return true;
                    }
                } else {
                    if (matrix[index][mid] > target) {
                        end = mid - 1;
                    } else if (matrix[index][mid] < target) {
                        start = mid + 1;
                    } else {
                        return true;
                    }
                }
            }
            return false;
        }

        console.log(findNumberIn2DArray(matrix, target));