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.

解答：自己一开始的想法比较麻烦，先对列进行2分查找，找到所在列，然后在对所在行进行二分

比较快捷的方法是从右上角开始，如果数值小于当前值，x--,否则y++,找到直接返回TRUE，否则返回false;

class Solution {
public:
    bool searchMatrix(vector<vector<int> > &matrix, int target) {
        int i = 0, j = matrix[0].size() - 1;
        while (i < matrix.size() && j >= 0)
        {           
            if (target == matrix[i][j])                 
                return true;
            else if (target < matrix[i][j])
                 j--;
            else
                 i++;
         }
         
         return false;
    }
};