LeetCode Search a 2D Matrix II

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

代码

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