✅Easy solution || ✅Short & Simple || ✅Best Method || ✅Easy-To-Understand
\n# Code\n\nclass Solution {\npublic:\n    bool searchMatrix(vector<vector<int>>& matrix, int target) {\n        int m=matrix.size();\n        int n=matrix[0].s
\n# Code\n```\nclass Solution {\npublic:\n    bool searchMatrix(vector<vector<int>>& matrix, int target) {\n        int m=matrix.size();\n        int n=matrix[0].size();\n        int r=0,c=n-1;\n        while(r<m && c>=0)\n        {\n            if(matrix[r][c]==target)\n                return target;\n            else if(matrix[r][c]>target)\n                c--;\n            else\n                r++;\n        }\n        return false;\n    }\n};\n```\nPlease **UPVOTE** if it helps \u2764\uFE0F\uD83D\uDE0A\nThank You and Happy To Help You!!
['C++']