LeetCode 1380 矩阵中的幸运数[数组] HERODING的LeetCode之路

Posted 2022-02-21 HERODING23

解题思路：
用两个数组统计每行中最小的数和每列中最大的数即可，代码如下：

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;
    
;