【力扣 中等 C++】74. 搜索二维矩阵

目录

题目

解法一：二分查找

---

题目

待添加

解法一：二分查找

class Solution
{
public:
    bool searchMatrix(vector>& matrix, int target)
    {
        int row{static_cast(matrix.size())};
        int col{static_cast(matrix[0].size())};
        int size{row * col};
        int left{}, right{size - 1};

        while (left <= right)
        {
            int mid{(left + right) >> 1};
            int m{mid / col};
            int n{mid % col};

            if (matrix[m][n] < target)
            {
                left = mid + 1;
            }
            else if (matrix[m][n] > target)
            {
                right = mid - 1;
            }
            else
            {
                return true;
            }
        }
        return false;
    }
};