题目:
代码(首刷瞄了眼思路 2024年3月4日):
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int m = matrix.size();
int n = matrix[0].size();
int row = 0, column = n - 1;
while (matrix[row][column] != target) {
if (column == 0 && matrix[row][column] > target
|| row == m - 1 && matrix[row][column] < target) {
return false;
}
if (column > 0 && matrix[row][column] > target) {
column--;
}
else if (row < m && matrix[row][column] < target ) {
row++;
}
}
return true;
}
};