作者:小迅
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
题目
示例
思路
题意 -> 给定一个二维数组,返回按规则合并后的数组
直接按照题目要求进行枚举即可
对于每一个位置,都枚举当前位置的周边位置,并取最大值保存
代码注释超级详细
代码
/**
* Return an array of arrays of size *returnSize.
* The sizes of the arrays are returned as *returnColumnSizes array.
* Note: Both returned array and *columnSizes array must be malloced, assume caller calls free().
*/
#define MAX(a, b) ((a) > (b) ? (a) : (b))
int max(int **grid, int x, int y)//枚举最值
{
int max = -1;
for (int i = x-1; i < x+2; i++) {
for (int j = y-1; j < y+2; j++) {
max = MAX(max, grid[i][j]);
}
}
return max;
}
int** largestLocal(int** grid, int gridSize, int* gridColSize, int* returnSize, int** returnColumnSizes){
int **ans = malloc(sizeof(int *) * (gridSize-2));
*returnColumnSizes = malloc(sizeof(int) * (gridSize-2));
*returnSize = 0;
for (int i = 0; i < gridSize-2; ++i) {
ans[*returnSize] = malloc(sizeof(int) * (gridSize - 2));
(*returnColumnSizes)[*returnSize] = gridSize - 2;
(*returnSize)++;
for (int j = 0; j < gridSize-2; ++j) {
ans[i][j] = max(grid, i+1, j+1);//记录每个位置的最值
}
}
return ans;
}
作者:小迅
链接:https://leetcode.cn/problems/largest-local-values-in-a-matrix/solutions/2139755/mo-ni-zhu-shi-chao-ji-xiang-xi-by-xun-ge-s7x5/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。