题解——Leetcode 240. Search a 2D Matrix II 难度：Medium

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.

给定一个m x n的矩阵，矩阵每行满足从左到右数值递增，每列满足从上到下数值递增，给定一个目标值，判断其是否在矩阵中。

从矩阵的右上角开始遍历，因为目标值比该位置的值小时，可以向左移，目标值更大时，可以向下移。如果遍历过程中找到与目标值匹配的值，则返回true，反之，如果行或列任意一个遍历超过矩阵范围时，遍历结束，返回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();
       
        
        int i = 0, j = n - 1;
        while(i < m && j >= 0){
            if(matrix[i][j] == target)
                return true;
            else if(matrix[i][j] < target)
                i++;
            else
                j--;
        }
        return false;
    }
};