【二分查找】面试题 10.09. 排序矩阵查找

题目：

 

 

解答:

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) 
    {
        int i = matrix.size() - 1;
        int j = 0;

        // 左下角开始哦
        while (i >= 0 && j < matrix[0].size())
        {
            if (target == matrix[i][j])
            {
                return true;
            }
            else if (target < matrix[i][j])
            {
                i--;
            }
            else if(target > matrix[i][j])
            {
                j++;
            }
        }
        return false;
    }
};