add: 220215-CN

This commit is contained in:
Lam Haoyin 2022-02-15 00:31:53 +08:00
parent 90789cc2c4
commit 512775b7be
No known key found for this signature in database
GPG Key ID: 8C089CB1A2B7544F
2 changed files with 37 additions and 1 deletions

36
2202/220215-CN.cpp Normal file
View File

@ -0,0 +1,36 @@
#include <vector>
#include <cstdio>
/**
* 1380. Lucky Numbers in a Matrix
* Given an m x 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.
*/
class Solution {
public:
static std::vector<int> luckyNumbers (const std::vector<std::vector<int>>& matrix) {
int m = matrix.size(), n = m ? matrix.front().size() : 0;
std::vector<int> rowMin(m), colMax(n, -0x7FFFFFFF);
for (int i = 0; i < m; ++i)
rowMin[i] = *std::min_element(matrix[i].begin(), matrix[i].end());
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
colMax[i] = std::max(matrix[j][i], colMax[i]);
std::vector<int> ret;
for (int i = 0; i < m; ++i)
for (int j = 0; j < n; ++j)
if (matrix[i][j] == rowMin[i] && matrix[i][j] == colMax[j])
ret.push_back(matrix[i][j]);
return ret;
}
};
int main() {
const auto ret = Solution::luckyNumbers({{3,7,8},{9,11,13},{15,16,17}});
for (int i : ret) {
std::printf("%d ", i);
}
return 0;
}

View File

@ -3,4 +3,4 @@ PROJECT(2202)
SET(CMAKE_CXX_STANDARD 23) SET(CMAKE_CXX_STANDARD 23)
ADD_EXECUTABLE(2202 220214.cpp) ADD_EXECUTABLE(2202 220215-CN.cpp)