原题链接:https://leetcode-cn.com/problems/lucky-numbers-in-a-matrix/
class Solution {
public:
vector<int> luckyNumbers (vector<vector<int>>& matrix) {
vector<int> res;
unordered_set<int> st;
int m = matrix.size(), n = matrix[0].size();
// 求行中最小
for (int i = 0; i < m; ++i) {
int j = min_element(matrix[i].begin(), matrix[i].end()) - matrix[i].begin();
st.insert(matrix[i][j]);
}
// 求列中最大
for (int j = 0; j < n; ++j) {
int mi_c = INT_MIN;
for (int i = 0; i < m; ++i) {
mi_c = max(mi_c, matrix[i][j]);
}
if (st.count(mi_c)) res.push_back(mi_c);
}
return res;
}
};