LeetCode 74. 搜索二维矩阵

class Solution {
public:
    bool searchMatrix(vector>& matrix, int target) {
        int n=matrix.size();
        if(!n) return false;
        int m=matrix[0].size();
        int l=0,r=n*m-1;
        while(l>1;
            if(matrix[mid/m][mid%m]<=target) l=mid;
            else r=mid-1;
        }

        return matrix[r/m][r%m]==target;

    }
};