class Solution {
public:
int maxIncreaseKeepingSkyline(vector<vector<int>>& grid) {
int n = grid.size(), m = grid[0].size();
vector<int> max_rows(n);
vector<int> max_cols(n);
for (int i = 0; i < n; i++) {
int max_row = 0;
int max_col = 0;
for (int j = 0; j < n; j++) {
max_row = max(max_row, grid[i][j]);
max_col = max(max_col, grid[j][i]);
}
max_rows[i] = max_row;
max_cols[i] = max_col;
}
int res = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int max_height = min(max_rows[i], max_cols[j]);
res += (max_height - grid[i][j]);
}
}
return res;
}
};
Python两行代码
class Solution:
def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int:
rowMax = list(map(max, grid))
colMax = list(map(max, zip(*grid)))
return sum(min(rowMax[i], colMax[j]) - h for i, row in enumerate(grid) for j, h in enumerate(row))