Leetcode 1380 lucky numbers in matrix [array] the leetcode path of heroding

Their thinking ：
Use two arrays to count the minimum number in each row and the maximum number in each column , The code is as follows ：

class Solution {
    
public:
    vector<int> luckyNumbers (vector<vector<int>>& matrix) {
    
        vector<int> res;
        int m = matrix.size();
        int n = matrix[0].size();
        vector<int> row(m, INT_MAX);
        vector<int> col(n, 0);
        for(int i = 0; i < m; i ++) {
    
            for(int j = 0; j < n; j ++) {
    
                if(matrix[i][j] < row[i]) {
    
                    row[i] = matrix[i][j];
                }
                if(matrix[i][j] > col[j]) {
    
                    col[j] = matrix[i][j];
                }
            }
        }
        for(int i = 0; i < m; i ++) {
    
            for(int j = 0; j < n; j ++) {
    
                if(matrix[i][j] == row[i] && matrix[i][j] == col[j]) {
    
                    res.push_back(matrix[i][j]);
                }
            }
        }
        return res;
    }
};