class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
int rows = matrix.size();
int cols = matrix[0].size();
int i = 0, j = cols-1;
while( 1 ) {
if( matrix[i][j] == target ) {
return true;
}
if( target < matrix[i][j] ) {
j--;
}
else {
i++;
}
if( i == rows || j == -1 ) {
return false;
}
}
return false;
}
};
Arpit's Newsletter read by 15000+ engineers
🔥 Thrice a week, in your inbox, an essay about system design, distributed systems, microservices, programming languages internals, or a deep dive on some super-clever algorithm, or just a few tips on building highly scalable distributed systems.