-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path051. Lucky Numbers in a Matrix.py
73 lines (59 loc) · 1.85 KB
/
051. Lucky Numbers in a Matrix.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
# Lucky Numbers in a Matrix
"""
Given a 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.
Example 1:
Input: matrix = [[3,7,8],[9,11,13],[15,16,17]]
Output: [15]
Explanation: 15 is the only lucky number since it is the minimum in its row and the maximum in its column
Example 2:
Input: matrix = [[1,10,4,2],[9,3,8,7],[15,16,17,12]]
Output: [12]
Explanation: 12 is the only lucky number since it is the minimum in its row and the maximum in its column.
Example 3:
Input: matrix = [[7,8],[1,2]]
Output: [7]
"""
def luckyNumbers(matrix):
"""
:type matrix: List[List[int]]
:rtype: List[int]
"""
row = []
col = []
out = []
for mat in matrix:
row.append(min(mat))
for j in range(len(matrix[0])):
colmn = [num[j] for num in matrix]
col.append(max(colmn))
for r in row:
if r in col:
out.append(r)
return out
# common_elements = set(row).intersection(col)
# return (list(common_elements))
# row = []
# col = []
# # for mat in matrix:
# # row.append(min(mat))
# # print(row)
# x = len(matrix)
# if len(matrix[0]) == 1:
# # print()
# return max(matrix)
# for i in range(len(matrix[0])):
# if i < x:
# row.append(min(matrix[i]))
# j = 0
# m = 0
# lst = []
# while j <= x-1:
# print(matrix[j][i])
# lst.append(matrix[j][i])
# j += 1
# col.append(max(lst))
# # print(matrix)
# print(col)
# common_elements = set(row).intersection(col)
# return (list(common_elements))