【Leetcode】807. Max Increase to Keep City Skyline
Description
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.
Discuss
先求出该矩阵的skyline,这样可以得到每个节点的skyline最小值,遍历矩阵的每一个元素,与最小值的差值就是增加建筑物高度的总和。
Code
class Solution {
public int maxIncreaseKeepingSkyline(int[][] grid) {
if (grid == null || grid.length == 0 || grid[0].length == 0) { return 0; }
int m = grid.length;
int n = grid[0].length;
int[] col = new int[m];
int[] row = new int[n];
for (int i = 0; i < m; i++) {
int max = Integer.MIN_VALUE;
for (int j = 0; j < m; j++) {
if (grid[i][j] > max) { max = grid[i][j]; }
}
col[i] = max;
}
for (int i = 0; i < n; i++) {
int max = Integer.MIN_VALUE;
for (int j = 0; j < m; j++) {
if (grid[j][i] > max) { max = grid[j][i]; }
}
row[i] = max;
}
int sum = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
int tmp = Math.min(col[i], row[j]);
if (grid[i][j] <= tmp) { sum += tmp - grid[i][j]; }
}
}
return sum;
}
}
最新文章
- INF文件的安装/卸载命令
- 老学员的学习感悟 --prince2认证有什么用
- QWT6.0.1+win7下安装说明
- execute连接 类型
- 【技术文档】《算法设计与分析导论》R.C.T.Lee等&#183;第7章 动态规划
- PHP命名空间理解
- C语言--第0次作业
- Django 学生管理系统
- WebService学习--(二)webservice相关介绍
- PAT1120: Friend Numbers
- ASP.NET Core 共享第三方依赖库部署的正常打开方式
- 回车\r与换行\n
- 【调试基础】Part 5 PE格式
- 90 行 Python 搭一个音乐搜索工具
- 不幸,我的Ryzen 7 1700X中招了,也有segfault
- python js(JavaScript)初识
- The open source JavaScript graphing library that powers Plotly
- 17秋 软件工程 Alpha 事后诸葛亮会议
- <;20180927>;新开一篇章记录常用到的IT名词
- javax.inject包