240. Search a 2D Matrix II (二维矩阵二分)

最新推荐文章于 2025-01-17 21:53:09 发布

SlienceAccept

最新推荐文章于 2025-01-17 21:53:09 发布

阅读量229

点赞数

CC 4.0 BY-SA版权

分类专栏：二分

本文链接：https://blog.youkuaiyun.com/qq_37708702/article/details/89792793

二分专栏收录该内容

12 篇文章

订阅专栏

博客介绍了一个在m x n矩阵中搜索值的高效算法。该矩阵每行从左到右、每列从上到下升序排列。还给出示例矩阵，展示了不同目标值的搜索结果，并提及有视频题解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

Integers in each row are sorted in ascending from left to right.
Integers in each column are sorted in ascending from top to bottom.

Example:
Consider the following 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]
]

Given target = 5, return true.

Given target = 20, return false.

视频题解

bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if(matrix.empty() || matrix[0].empty()) return false;
        int i = 0,j = matrix[0].size() - 1;
        while(i < matrix.size() && j >= 0){
            if(matrix[i][j] == target) return true;
            else if(matrix[i][j] > target) j--;
            else i++;
        }
        return false;
    }