#include <leetcode.h>
|
static vector< int > | luckyNumbers (vector< vector< int > > &matrix) |
|
◆ luckyNumbers()
vector< int > leetcode::lucky_numbers_in_a_matrix::Solution::luckyNumbers |
( |
vector< vector< int > > & |
matrix | ) |
|
|
static |
在文件 leetcode.cpp 第 2929 行定义.
2930 auto ans = vector<int>();
2931 const auto m = matrix.size();
2932 const auto n = matrix[0].size();
2933 auto *minimum =
new int[m];
2934 memset(minimum, 50, m *
sizeof(
int));
2935 auto *maximum =
new int[n];
2936 memset(maximum, 0, n *
sizeof(
int));
2937 for(
int i = 0; i < m; i++) {
2938 for(
int j = 0; j < n; j++) {
2939 minimum[i] = min(minimum[i], matrix[i][j]);
2940 maximum[j] = max(maximum[j], matrix[i][j]);
2943 for(
int i = 0; i < m; i++) {
2944 for(
int j = 0; j < n; j++) {
2945 if(matrix[i][j] == minimum[i] && matrix[i][j] == maximum[j]) {
2946 ans.push_back(matrix[i][j]);
被这些函数引用 leetcode::lucky_numbers_in_a_matrix::TEST().
该类的文档由以下文件生成: