Search a 2D Matrix

真水壶

于 2014-03-03 22:06:55 发布

阅读量362

点赞数

分类专栏： leetcode 文章标签：查找

本文链接：https://blog.csdn.net/enjoyuseless/article/details/20402629

版权

leetcode 专栏收录该内容

154 篇文章 0 订阅

订阅专栏

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        if(matrix.empty())  return false;
        const size_t row=matrix.size();
        const size_t column=matrix.front().size();
        int left=0;
        int right=row*column-1;
        while(left<=right)
        {
            int mid=left+(right-left)/2;
            if(matrix[mid/column][mid%column]==target)
            {
                return true;
            }
            else if(matrix[mid/column][mid%column]>target)
            {
                right=mid-1;
            }
            else
            {
                left=mid+1;
            }
        }
        return false;
    }
};