题目链接:https://leetcode-cn.com/problems/search-a-2d-matrix-ii/
题目如下:
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.size()==0) return false;
int x=0,y=matrix[0].size()-1;//(x,y)对应为最左下角的值
while(x<matrix.size()&&y>=0){
if(matrix[x][y]==target) return true;
else if(matrix[x][y]>target) --y;
else if(matrix[x][y]<target) ++x;
}
return false;
}
};