algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 01:44:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

update: var name & make

Browse Source
This commit is contained in:
huoyinghui
2021-12-17 11:27:48 +08:00
committed by tphyhFighting
parent ce7c41b9c4
commit e3bde6844b
2 changed files with 12 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline.go
View File

@ -1,8 +1,9 @@
package leetcode package leetcode
func maxIncreaseKeepingSkyline(grid [][]int) int { func maxIncreaseKeepingSkyline(grid [][]int) int {
var topBottomSkyline []int n := len(grid)
var leftRightSKyline []int topBottomSkyline := make([]int, 0, n)
leftRightSkyline := make([]int, 0, n)
for i := range grid { for i := range grid {
cur := 0 cur := 0
for _, v := range grid[i] { for _, v := range grid[i] {
@ -10,7 +11,7 @@ func maxIncreaseKeepingSkyline(grid [][]int) int {
cur = v cur = v
} }
} }
leftRightSKyline = append(leftRightSKyline, cur) leftRightSkyline = append(leftRightSkyline, cur)
} }
for j := range grid { for j := range grid {
cur := 0 cur := 0
@ -24,7 +25,7 @@ func maxIncreaseKeepingSkyline(grid [][]int) int {
var ans int var ans int
for i := range grid { for i := range grid {
for j := 0; j < len(grid[0]); j++ { for j := 0; j < len(grid[0]); j++ {
ans += min(topBottomSkyline[j], leftRightSKyline[i]) - grid[i][j] ans += min(topBottomSkyline[j], leftRightSkyline[i]) - grid[i][j]
} }
} }
return ans return ans

13
leetcode/0807.Max-Increase-to-Keep-City-Skyline/README.md
View File

@ -48,8 +48,8 @@ Return the maximum total sum that the height of the buildings can be increased b
## 解题思路 ## 解题思路
- 从数组竖直方向（即顶部，底部）看“天际线”计算出topBottomSkyline - 从数组竖直方向（即顶部，底部）看“天际线”计算出topBottomSkyline
- 从数组水平方向（即左侧，右侧）看“天际线”计算出leftRightSKyline - 从数组水平方向（即左侧，右侧）看“天际线”计算出leftRightSkyline
- 计算grid中每个元素与对应的topBottomSkyline和leftRightSKyline中较小值的差值 - 计算grid中每个元素与对应的topBottomSkyline和leftRightSkyline中较小值的差值
- 统计所有差值的总和ans并返回 - 统计所有差值的总和ans并返回
## 代码 ## 代码
@ -58,8 +58,9 @@ Return the maximum total sum that the height of the buildings can be increased b
package leetcode package leetcode
func maxIncreaseKeepingSkyline(grid [][]int) int { func maxIncreaseKeepingSkyline(grid [][]int) int {
var topBottomSkyline []int n := len(grid)
var leftRightSKyline []int topBottomSkyline := make([]int, 0, n)
leftRightSkyline := make([]int, 0, n)
for i := range grid { for i := range grid {
cur := 0 cur := 0
for _, v := range grid[i] { for _, v := range grid[i] {
@ -67,7 +68,7 @@ func maxIncreaseKeepingSkyline(grid [][]int) int {
cur = v cur = v
} }
} }
leftRightSKyline = append(leftRightSKyline, cur) leftRightSkyline = append(leftRightSkyline, cur)
} }
for j := range grid { for j := range grid {
cur := 0 cur := 0
@ -81,7 +82,7 @@ func maxIncreaseKeepingSkyline(grid [][]int) int {
var ans int var ans int
for i := range grid { for i := range grid {
for j := 0; j < len(grid[0]); j++ { for j := 0; j < len(grid[0]); j++ {
ans += min(topBottomSkyline[j], leftRightSKyline[i]) - grid[i][j] ans += min(topBottomSkyline[j], leftRightSkyline[i]) - grid[i][j]
} }
} }
return ans return ans