12ms c++


  • 0
    B
    class Solution {
    public:
        bool searchMatrix(vector <vector<int> >& matrix, int target) {
            int row = matrix.size(), col = matrix[0].size();
            int left = 0, right = row * col - 1;
            while (left <= right)
            {
                int mid = left +(right - left)/2;
                int r = mid / col, c = mid % col;
                if (matrix[r][c]==target) return true;
                if (matrix[r][c] < target)
                    left = mid +1;
                else
                    right = mid -1;
            }
            return false;
        }
    };
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.