240. Search a 2D Matrix II

题目：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 in ascending from left to right.

• Integers in each column are sorted in ascending from top to bottom.

  For example,
  Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.
Given target = 20, return false.
思路： 根据矩阵中数据存储的特点，从矩阵的右上角开始查找。

• 如果matrix[i][j]==target，则返回true；
• 如果matrix[i][j] < target，则往下查找即i++；
• 如果matrix[i][j] > target，则往左边进行查找即j- -；

最后要是没找到则返回false。代码如下：

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        if (!matrix.size()) return false;
        int row = matrix.size(), col = matrix[0].size();
        int i = 0, j = col-1;

        while (i < row && j >= 0) {
            if (matrix[i][j] == target) return true;
            else if (matrix[i][j] < target) i++;
            else j--; 
        }
        return false;
    }
};