leetcode

0 class Solution {

1 public:

2 vector<int> luckyNumbers(const vector<vector<int>> &matrix) const {

3 static int row[51], col[51];

4 const int n = size(matrix);

5 const int m = size(matrix[0]);

6 vector<int> res;

7

8 memset(row, 0x7F, sizeof(row));

9 memset(col, 0x00, sizeof(col));

10

11 for (int i = 0; i < n; i++) {

12 for (int j = 0; j < m; j++) {

13 row[i] = min(row[i], matrix[i][j]);

14 col[j] = max(col[j], matrix[i][j]);

15 }

16 }

17

18 for (int i = 0; i < n; i++) {

19 for (int j = 0; j < m; j++) {

20 if (row[i] != matrix[i][j]) continue;

21 if (col[j] != matrix[i][j]) continue;

22 res.push_back(matrix[i][j]);

23 }

24 }

25

26 return res;

27 }

28 };