leetcode_83 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.

Example 1:

Input:
matrix = [
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]
target = 3
Output: true

Example 2:

Input:
matrix = [
  [1,   3,  5,  7],
  [10, 11, 16, 20],
  [23, 30, 34, 50]
]
target = 13
Output: false

算法: 左下角的点，向上递减，向右递增，因此可以作为比较的中间点，如果比目标大向上移动，如果比目标小，向下移动

代码如下：

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