In a 2 dimensional array grid
, each value grid[i][j]
represents the height of a building located there. We are allowed to increase the height of any number of buildings, by any amount (the amounts can be different for different buildings). Height 0 is considered to be a building as well.
At the end, the "skyline" when viewed from all four directions of the grid, i.e. top, bottom, left, and right, must be the same as the skyline of the original grid. A city's skyline is the outer contour of the rectangles formed by all the buildings when viewed from a distance. See the following example.
What is the maximum total sum that the height of the buildings can be increased?
Example: Input: grid = [[3,0,8,4],[2,4,5,7],[9,2,6,3],[0,3,1,0]] Output: 35 Explanation: The grid is: [ [3, 0, 8, 4], [2, 4, 5, 7], [9, 2, 6, 3], [0, 3, 1, 0] ] The skyline viewed from top or bottom is: [9, 4, 8, 7] The skyline viewed from left or right is: [8, 7, 9, 3] The grid after increasing the height of buildings without affecting skylines is: gridNew = [ [8, 4, 8, 7], [7, 4, 7, 7], [9, 4, 8, 7], [3, 3, 3, 3] ]
Notes:
1 < grid.length = grid[0].length <= 50
.- All heights
grid[i][j]
are in the range[0, 100]
. - All buildings in
grid[i][j]
occupy the entire grid cell: that is, they are a1 x 1 x grid[i][j]
rectangular prism.
思路:遍历数组,记录每行每列的最大值;重新遍历数组,对于i行j列的数,找到i行最大值和j列最大值的最小值,减去当前值,则是最大的可以增加的数值。
代码如下:
class Solution {
public int maxIncreaseKeepingSkyline(int[][] grid) {
int row = grid.length;
if(row == 0)
return 0;
int line = grid[0].length;
int[] rows = new int[row], lines = new int[line];
for(int i = 0; i < row; i++){
for(int j = 0; j < line; j++){
rows[i] = Math.max(rows[i], grid[i][j]);
lines[j] = Math.max(lines[j], grid[i][j]);
}
}
int res = 0;
for(int i = 0; i < row; i++){
for(int j = 0; j < line; j++){
int max = Math.min(rows[i], lines[j]);
res += max - grid[i][j];
}
}
return res;
}
}