leetcode 807. Max Increase to Keep City Skyline（不变天际线的最大化）

题目

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?

题目理解

在不改变每行的最大值、每列的最大值的情况下，其他元素可以增加，问最多增加多少。

地址

https://leetcode.com/problems/max-increase-to-keep-city-skyline/description/

例子

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] ]

分析与算法

如果我们遍历所有的元素，那么每个元素增加的最大值，则是需要满足不能超过当行最大值、当列最大值。
算法如下：

 1. 遍历元素grid[i][j]
 2. 元素增加d
 3. d满足不能大于max(grid[i]), 也不能大于max(grid[:j])
 4. 遍历所有元素累加d即求出最后的结果。

代码

    def maxIncreaseKeepingSkyline3(self, grid):
        max_row = [max(row) for row in grid]
        max_col = [max(col) for col in zip(*grid)]
        result = 0
        for i, row in enumerate(grid):
            for j, h in enumerate(row):
                result += min(max_row[i], max_col[j]) - h
        return result

总结

1. 理解题目，就是保持行、列的最大值不变！
2. 那么满足条件下，其实每个元素的增加值就是行、列的最大值的最小值-当前值；
3. 遍历所有的元素，累加求解最后的结果。
4. 利用python求解最大值（list）的方法：[max(row) for row in grid]
5. python遍历元素：for i, row in enumerate(grid): #行标，行值