LeetCode240. 搜索二维矩阵 II

240. 搜索二维矩阵 II

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