1 class Solution { 2 public: 3 bool searchMatrix(vector<vector<int>>& matrix, int target) { 4 if(matrix.size()==0||matrix[0].size()==0) 5 return false; 6 int row=matrix.size(); 7 int col=matrix[0].size(); 8 int x=0, y=row-1; 9 while(x<col&&y>-1){ 10 if(matrix[y][x]==target) 11 return true; 12 else if(matrix[y][x]>target) 13 --y; 14 else 15 ++x; 16 } 17 return false; 18 } 19 };
从左下角开始,当前值大于target就向上走,小于target就向右走