C++ || BINARY SEARCH || EASIEST APPROACH
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    bool searchMatrix(vector<vector<int>>& matrix, int target) {\n        int i=0;\n        int j=matrix[0].size()-1;\n\n        while(i<matrix.size() && j>=0){\n            if(matrix[i][j]==target)return true;\n            else if(matrix[i][j]<target)i++;\n            else j--;\n        }\n\n        return false;\n    }\n};\n```
['Array', 'Binary Search', 'C++']