Leet Code Daily 2024-05-12 - Largest Local Values in a Matrix
Code
● ● ●c++class Solution {
public:
vector<vector<int>> largestLocal(vector<vector<int>>& grid) {
int n = grid.size(), m = grid[0].size();
vector<vector<int>> ans;
for (int i = 1; i + 1 < n; i++) {
vector<int> row;
for (int j = 1; j + 1 < m; j++) {
int max_val = INT_MIN;
for (int p = i - 1; p <= i + 1; p++) {
for (int q = j - 1; q <= j + 1; q++) {
max_val = max(max_val, grid[p][q]);
}
}
row.push_back(max_val);
}
ans.push_back(row);
}
return ans;
}
};