原题链接:240. 搜索二维矩阵 II
solution: 从二维矩阵右上角开始搜索,matrix[i][j] > target,j--,else i++;
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int n = matrix.size();
int m = matrix[0].size();
for(int i = 0,j = m - 1;i < n && j >= 0;){
if(matrix[i][j] > target) j--;
else if(matrix[i][j] < target) i++;
else return true;
}
return false;
}
};