Search a 2D Matrix

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row.

For example,

Consider the following matrix:

[
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]

Given target = 3, return true.

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int up, down, left, right;
        up = 0; down = matrix.size() - 1;
        int mid;
        while(up < down){
            mid = (up+down)/2;
            if(matrix[mid][0] <= target && matrix[mid + 1][0] > target){
                up = mid;
                break;
            } else if(matrix[mid][0] > target){
                down = mid -1;
            } else {
                up = mid+1;
            }
        }
        left = 0; 
        right = matrix[0].size()-1;
        while(left < right){
            mid = (left+right)/2;
            if(matrix[up][mid] == target){
                return true;
            } else if(matrix[up][mid] > target){
                right = mid -1;
            } else {
                left = mid+1;
            }
        }
        if(matrix[up][left] == target){
            return true;
        }
        return false;
    }
};