int maxIncreaseKeepingSkyline(int** grid, int gridSize, int* gridColSize){
int m = gridSize;
int n = gridColSize;
int res = 0;
int R = (int*)malloc(sizeof(int)m);
int C = (int*)malloc(sizeof(int)*n);
memset(R, 0, sizeof®);
memset(C, 0, sizeof©);
int temp;
for(int i=0; i<m; i++){
temp = 0;
for(int j=0; j<n; j++){
if(grid[i][j] >= temp)
temp = grid[i][j];
R[i] = temp;
}
}
for(int i=0; i<n; i++){
temp = 0;
for(int j=0; j<m; j++){
if(grid[j][i] >= temp)
temp = grid[j][i];
C[i] = temp;
}
}
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
res += (C[i]<R[j] ? C[i] : R[j]) - grid[j][i];
}
}
return res;
}
leetcode 807. 保持城市天际线
最新推荐文章于 2024-07-14 23:14:51 发布