Search-a-2d-matrix (two-dimensional matrix lookup)

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

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

For example,

Consider the following matrix:

[  [1,   3,  5,  7],  [Ten, One,],  [23, 30, 34, 50]]

Given target =3, Returntrue.

Class Solution {public:    bool Searchmatrix (vector<vector<int> > &matrix, int target) {        int m = Mat Rix.size ();        int n = matrix[0].size ();        int c = n-1;        for (int r = 0; (r<m) && (c>=0);)        {            if (matrix[r][c]>target)            {                c--;            }            else if (matrix[r][c]<target)            {                r++;            }            else                return true;        }        return false;    }    Each comparison line at the end, because it has been sorted well, you can delete the row and column};

　　

Search-a-2d-matrix (two-dimensional matrix lookup)