[Leet Code] Lucky numbers in a matric
m * n matrix of distinct numbers, return all lucky numbers in the matrix in any order.
A lucky number is an element of the matrix such that it is the minimum element in its row and maximum in its column.
Input: matrix = [[3,7,8],[9,11,13],[15,16,17]]
Explanation: 15 is the only lucky number since it is the minimum in its row and the maximum in its column
Input: matrix = [[1,10,4,2],[9,3,8,7],[15,16,17,12]]
Explanation: 12 is the only lucky number since it is the minimum in its row and the maximum in its column.
Input: matrix = [[7,8],[1,2]]
m == mat.length
n == mat[i].length
1 <= n, m <= 50
1 <= matrix[i][j] <= 10^5.
- All elements in the matrix are distinct.
def luckyNumbers (self, matrix):
:type matrix: List[List[int]]
answers = 
for i in range(len(matrix)):
row = matrix[i].index(min(matrix[i]))
if min(matrix[i]) == max([column[row] for column in matrix]):