摘要： class Solution {public: bool searchMatrix(vector<vector<int> > &matrix, int target) { int low=0,high=matrix.size()-1; if(high==-1)return 0; int level=0; //if(matrix[0][0]>target)return false; while(low<=high) { level=(low+high)/2; ... 阅读全文