矩阵的二分查找！【手绘漫画】图解LeetCode之搜索二维矩阵（LeetCode 74）

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if(matrix.empty()||matrix[0].empty()) return false;

        int m=matrix[0].size(),n=matrix.size();
        int left=0;
        int right=m*n-1;
        while(left<right){
            int mid=left+right>>1;
            if(matrix[mid/m][mid%m]>=target){
                right=mid;
            }
            else{
                left=mid+1;
            }
        }
        if(matrix[left/m][left%m]==target) return true;
        return false;
    }
};