【二分查找】240. 搜索二维矩阵 II

题目：

 

 

解答：

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 (matrix[i][j] == target) 
            {
                return true;
            }
            else if (matrix[i][j] > target) 
            {
                i--;
            }
            else 
            {
                j++;
            }
        }
        return false;
    }
};