算法1
时间复杂度
C++ 代码
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.empty() || matrix[0].empty()) return 0;
int i = 0, j = matrix[0].size() - 1;
while(i >= 0 && i < matrix.size() && j >= 0 && j < matrix[0].size())
{
if(matrix[i][j] == target) return true;
else if(matrix[i][j] > target ) j--;
else i++;
}
return false;
}
};