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?

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 a 1 x 1 x grid[i][j] rectangular prism.

Solution:
//Kotlin
import java.lang.Integer.max
import java.lang.Integer.min

class Solution {
    fun maxIncreaseKeepingSkyline(grid: Array<IntArray>): Int {
        val xHeight = IntArray(grid[0].size)
        val yHeight = IntArray(grid.size)
        var sum = 0
        for ((x, row) in grid.withIndex()) {
            for ((y, value) in row.withIndex()) {
                xHeight[x] = max(xHeight[x], value)
                yHeight[y] = max(yHeight[y], value)
                sum -= value
            }
        }
        for (x in xHeight) {
            for (y in yHeight) {
                sum += min(x, y)
            }
        }
        return sum
    }
}
//Kotlin
class Solution {
    fun maxIncreaseKeepingSkyline(grid: Array<IntArray>): Int {
        val xHeight = IntArray(grid[0].size) { i -> grid.maxBy { it[i] }!![i] }
        val yHeight = IntArray(grid.size) { i -> grid[i].max()!! }
        var sum = 0
        xHeight.forEachIndexed { x, i ->
            yHeight.forEachIndexed { y, j ->
                sum += min(i, j) - grid[x][y]
            }
        }
        return sum
    }
}
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容

  • rljs by sennchi Timeline of History Part One The Cognitiv...
    sennchi阅读 7,452评论 0 10
  • The Inner Game of Tennis W Timothy Gallwey Jonathan Cape ...
    网事_79a3阅读 12,303评论 3 20
  • 如设置好的布景 那个漆黑的容器开始渗水 夜,唯一可藏身的地方 被浸漫!无处可逃 酸酸的记忆被咸涩中和 我被漂白成一...
    飞虹阅读 263评论 2 8
  • 过度疲劳是一个怎样的概念呢?怎样可以不过度?如何掌握这个度? 疲劳,是什么?很多人或许都没有一个正确的理解,以为爬...
    桔子花_1ded阅读 284评论 0 0
  • /* 多个参数分别相加,单个函数内的参数相乘 4 + 2 * 3 + 10 = 20*/function add ...
    有田春雪阅读 1,361评论 0 2