LeetCode Solutions
class Solution {
public:
int maxIncreaseKeepingSkyline(vector<vector<int>>& grid) {
const int n = grid.size();
int ans = 0;
vector<int> rowMax(n);
vector<int> colMax(n);
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
rowMax[i] = max(rowMax[i], grid[i][j]);
colMax[j] = max(colMax[j], grid[i][j]);
}
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
ans += min(rowMax[i], colMax[j]) - grid[i][j];
return ans;
}
};
|
class Solution {
public int maxIncreaseKeepingSkyline(int[][] grid) {
final int n = grid.length;
int ans = 0;
int[] rowMax = new int[n];
int[] colMax = new int[n];
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) {
rowMax[i] = Math.max(rowMax[i], grid[i][j]);
colMax[j] = Math.max(colMax[j], grid[i][j]);
}
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
ans += Math.min(rowMax[i], colMax[j]) - grid[i][j];
return ans;
}
}
|
class Solution:
def maxIncreaseKeepingSkyline(self, grid: List[List[int]]) -> int:
rowMax = list(map(max, grid))
colMax = list(map(max, zip(*grid)))
return sum(min(i, j) for i in rowMax for j in colMax) - sum(map(sum, grid))
|
