2373. 矩阵中的局部最大值

int** largestLocal(int** grid, int gridSize, int* gridColSize, int* returnSize, int** returnColumnSizes){
     int **ans = (int **)malloc(sizeof(int *) * (gridSize - 2));
    for (int i = 0; i < gridSize - 2; i++) {
        ans[i] = (int *)calloc(gridSize - 2, sizeof(int));
    }

    for(int i=0;i<gridSize-2;i++){
        for(int j=0;j<gridSize-2;j++){
            int max=0;
            for(int gridi=i;gridi<i+3;gridi++){
                for(int gridj=j;gridj<j+3;gridj++){
                    if(grid[gridi][gridj]>max){
                        max=grid[gridi][gridj];}
                }
            }
            ans[i][j]=max;


        }


    }
     *returnSize = gridSize - 2;
    *returnColumnSizes = (int *)calloc(gridSize - 2, sizeof(int));
    for (int i = 0; i < gridSize - 2; i++) {
        (*returnColumnSizes)[i] = gridSize - 2;
    }

    return ans;
}

 暴力循环迭代找到每三个的最大值，填入ans数组中，ans数组首先的Malloc