The correct, optimal and working solution for programming question search-a-2d-matrix on leetcode

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; } };