【leetcode C++】【剑指 Offer】 04. 二维数组中的查找

剑指 Offer 04. 二维数组中的查找

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

class Solution {
public:
    int max(int a, int b) {return a > b ? a : b;}
    bool findNumberIn2DArray(vector<vector<int>>& matrix, int target) {
        int n = matrix.size();
        if(n == 0) return false;
        int m = matrix[0].size();
        if(m == 0) return false;
        for(int ii = 0; ii < n; ii++) {
            if(matrix[ii][0] > target) break;
            for(int jj = 0; jj < m; jj++) {
                if(matrix[ii][jj] == target) return true;
                if(matrix[ii][jj] > target) break;
            }
        }
        return false;
    }
};

class Solution {
public:
    int max(int a, int b) {return a > b ? a : b;}
    bool findNumberIn2DArray(vector<vector<int>>& matrix, int target) {
        int n = matrix.size();
        if(n == 0) return false;
        int m = matrix[0].size();
        if(m == 0) return false;
        for(int ii = 0; ii < n; ii++) {
            for(int jj = 0; jj < m; jj++) {
                if(matrix[ii][jj] == target) return true;
            }
        }
        return false;
    }
};