240. Search a 2D Matrix II（图解）

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.

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.

Solution

C++

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

Explanation