c_cpp 240.搜索2D Matrix II

Posted 2021-05-14

class Solution {
public:
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        // 边界处理
        if (matrix.size() <= 0) {
            return false;
        }
        if (matrix[0].size() <= 0) {
            return false;
        }
        // 从最右边开始
        int i = 0;
        int j = matrix[i].size()-1;
        while (i < matrix.size()
               && j >= 0) {
            if (matrix[i][j] == target) {
                return true;
            }
            if (target < matrix[i][j]) {
                j--;
                continue;
            }
            if (target > matrix[i][j]) {
                i++;
                continue;
            }
        }
        return false;
    }
};