[Leetcode]74. Search a 2D Matrix

最新推荐文章于 2025-12-04 23:36:16 发布

原创最新推荐文章于 2025-12-04 23:36:16 发布 · 297 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

LeetCode 专栏收录该内容

116 篇文章

订阅专栏

本文介绍了一种高效的搜索算法，用于在一特殊类型的二维矩阵中查找指定数值。该矩阵每一行的整数从左到右递增排序，并且每行的第一个整数大于前一行的最后一个整数。文章提供了一个具体的示例矩阵及目标值，并展示如何通过算法找到目标值。

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 from left to right.
The first integer of each row is greater than the last integer of the previous row.

For example,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        int row = 0;
        int col = matrix[0].size() - 1;
        while (row < matrix.size() && col > -1) {
            if (matrix[row][col] == target) {
                return true;
            }
            else if (matrix[row][col] < target) {
                row++;
            }
            else
                col--;
        }
        return false;
    }
};