119：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.

代码如下：

// 时间复杂度 O(n)，空间复杂度 O(1)
class Solution {
public:
        bool searchMatrix(const vector<vector<int>>& matrix, int target) {
                if (matrix.empty()) return false;

                // 从最右上角元素出发
                int i = 0, j = matrix[0].size() - 1;
                while (i < matrix.size() && j >= 0) {
                        if (matrix[i][j] == target)          // 找到了
                                return true;                // 返回 true
                        else if (matrix[i][j] < target)     // 如果 target 值更大，说明那一行的元素都没有
                                ++i;                       // target 大，转到下一行
                        else --j;                          // 目标值更小，向左移一列
                }
                return false;
        }
};