class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.size()==0) return false;
for (int i=0; i<matrix.size();i++)
{
for (int j=0; j<matrix[0].size(); j++)
{
if (matrix[i][j]==target) return true;
}
}
return false;
}
};
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.size()==0) return false;
int row=matrix.size(), col=matrix[0].size();
int r=0, c=col-1;
while (r<row && c>=0)
{
if (matrix[r][c]>target) c--;
else if (matrix[r][c]<target) r++;
else return true;
}
return false;
}
};