从左下角开始搜
leetcode 74: 力扣
leetcode 240: 力扣
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int m = matrix.size() - 1, n = matrix[0].size() - 1;
int i = m, j = 0;
while(i >=0 && j <= n) {
if (matrix[i][j] == target) {
return true;
} else if(matrix[i][j] > target) {
i--;
} else {
j++;
}
}
return false;
}
};