leetcode 240. 搜索二维矩阵 II

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