1380. 矩阵中的幸运数

代码

class Solution {
    public List<Integer> luckyNumbers (int[][] matrix) {
        int row = matrix.length;
        int col = matrix[0].length;
        List<Integer> colList = new ArrayList<>();
        List<Integer> rowList = new ArrayList<>();
        //找同行最小
        for(int i = 0; i < row; i++ ) {
            int minRow = Integer.MAX_VALUE;
            for(int j = 0; j < col; j++ ) {
                minRow = Math.min(minRow,matrix[i][j] );
            }
            rowList.add(minRow);
        }
        //同一列的所有元素中最大
        for(int j = 0; j < col; j++ ) {
            int maxCol = Integer.MIN_VALUE;
            for(int i = 0; i < row; i++ ) {
                maxCol = Math.max(maxCol,matrix[i][j] );
            }
            if(rowList.contains(maxCol) ) {
                colList.add(maxCol);
            }
        }
        return colList;
    }
}