Search a 2D Matrix

直接把这个二维数组看做一个一维已排序的数组来做

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