Lucky Numbers in a Matrix LeetCode solution in Python

1
class Solution:
2
    def luckyNumbers(self, matrix: List[List[int]]) -> List[int]:
3
        min_, max_ = 0, 0
4
        min_temp = []
5
        max_temp = []
6
        m = len(matrix)
7
        n = len(matrix[0])
8
        for i in matrix:
9
            min_temp.append(min(i))
10
        print(min_temp)
11
        if n >= m:
12
            for i in range(n):
13
                max_check = []
14
                for j in range(m):
15
                    max_check.append(matrix[j][i])
16
                max_temp.append(max(max_check))
17
            return set(min_temp).intersection(set(max_temp))
18
        elif n == 1:
19
            for i in range(m):
20
                max_check = []
21
                for j in range(n):
22
                    max_check.append(matrix[i][j])
23
                max_temp.append(max(max_check))
24
            return [max(max_temp)]
25
        else:
26
            for i in range(n):
27
                max_check = []
28
                for j in range(m):
29
                    max_check.append(matrix[j][i])
30
                max_temp.append(max(max_check))
31
            return set(min_temp).intersection(set(max_temp))