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.

代码如下：

        bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int m=matrix.size();
        int n=matrix[0].size();
        for(int i=0;i<m;i++)
        {
            if(target==matrix[i][n-1])
            {
                return true;
            }
            if(target<matrix[i][n-1])
            {
               int tmpl=0,tmpr=n-2;
               while(tmpl<=tmpr)
               {
                   int tmp=tmpl+(tmpr-tmpl)/2;
                   if(target==matrix[i][tmp])
                   {
                       return true;
                   }
                   else if(target>matrix[i][tmp])
                   {
                       tmpl=tmp+1;
                   }
                   else
                   {
                       tmpr=tmp-1;
                   }
               }
               return false;
            }
        }
        return false;
    }