problemscpp
A collection of my answers to algorithm problems in c++.
静态 Public 成员函数 | 所有成员列表
leetcode::lucky_numbers_in_a_matrix::Solution类 参考

#include <leetcode.h>

静态 Public 成员函数

static vector< int > luckyNumbers (vector< vector< int > > &matrix)
 

详细描述

在文件 leetcode.h1143 行定义.

成员函数说明

◆ luckyNumbers()

vector< int > leetcode::lucky_numbers_in_a_matrix::Solution::luckyNumbers ( vector< vector< int > > &  matrix)
static

在文件 leetcode.cpp2929 行定义.

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]);
2941 }
2942 }
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]);
2947 }
2948 }
2949 }
2950 delete[] minimum;
2951 delete[] maximum;
2952 return ans;
2953 }

被这些函数引用 leetcode::lucky_numbers_in_a_matrix::TEST().


该类的文档由以下文件生成: