-
Notifications
You must be signed in to change notification settings - Fork 0
/
1380.luckyNumber.cpp
61 lines (60 loc) · 1.73 KB
/
1380.luckyNumber.cpp
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
class Solution {
public:
vector<int> luckyNumbers (vector<vector<int>>& matrix) {
int m = matrix.size();
int n = matrix[0].size();
vector<int> row(m, 0);
vector<int> col(n, 0);
for(int i = 0; i < m; i++){
int _min = INT_MAX;
for(int j = 0; j < n; j++){
_min = min(_min, matrix[i][j]);
}
row[i] = _min;
}
for(int j = 0; j < n; j++){
int _max = INT_MIN;
for(int i = 0; i < m; i++){
_max = max(_max, matrix[i][j]);
}
col[j] = _max;
}
vector<int> res;
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]){
// 无重复!!
if(row[i] == col[j])
res.push_back(row[i]);
// }
}
}
return res;
}
};
class Solution {
public:
vector<int> luckyNumbers (vector<vector<int>>& matrix) {
int m = matrix.size();
int n = matrix[0].size();
vector<int> row(m, 10001);
vector<int> col(n, 0);
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
row[i] = min(row[i], matrix[i][j]);
col[j] = max(col[j], matrix[i][j]);
}
}
vector<int> res;
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]){
// 无重复!!
if(row[i] == col[j])
res.push_back(row[i]);
// }
}
}
return res;
}
};