update: var name & make

huoyinghui · tphyhFighting · commit e3bde6844b91 · 2021-12-17T11:44:58.000+08:00
diff --git a/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline.go b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/807.Max Increase to Keep City Skyline.go
@@ -1,16 +1,17 @@
 package leetcode
 
 func maxIncreaseKeepingSkyline(grid [][]int) int {
-	var topBottomSkyline []int
-	var leftRightSKyline []int
+	n := len(grid)
+	topBottomSkyline := make([]int, 0, n)
+	leftRightSkyline := make([]int, 0, n)
 	for i := range grid {
 		cur := 0
 		for _, v := range grid[i] {
 			if cur < v {
 				cur = v
 			}
 		}
-		leftRightSKyline = append(leftRightSKyline, cur)
+		leftRightSkyline = append(leftRightSkyline, cur)
 	}
 	for j := range grid {
 		cur := 0
@@ -24,7 +25,7 @@ func maxIncreaseKeepingSkyline(grid [][]int) int {
 	var ans int
 	for i := range grid {
 		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
diff --git a/leetcode/0807.Max-Increase-to-Keep-City-Skyline/README.md b/leetcode/0807.Max-Increase-to-Keep-City-Skyline/README.md
@@ -48,8 +48,8 @@ Return the maximum total sum that the height of the buildings can be increased b
 ## 解题思路
 
 - 从数组竖直方向（即顶部，底部）看“天际线”计算出topBottomSkyline
-- 从数组水平方向（即左侧，右侧）看“天际线”计算出leftRightSKyline
-- 计算grid中每个元素与对应的topBottomSkyline和leftRightSKyline中较小值的差值
+- 从数组水平方向（即左侧，右侧）看“天际线”计算出leftRightSkyline
+- 计算grid中每个元素与对应的topBottomSkyline和leftRightSkyline中较小值的差值
 - 统计所有差值的总和ans并返回
 
 ## 代码
@@ -58,16 +58,17 @@ Return the maximum total sum that the height of the buildings can be increased b
 package leetcode
 
 func maxIncreaseKeepingSkyline(grid [][]int) int {
-	var topBottomSkyline []int
-	var leftRightSKyline []int
+	n := len(grid)
+	topBottomSkyline := make([]int, 0, n)
+	leftRightSkyline := make([]int, 0, n)
 	for i := range grid {
 		cur := 0
 		for _, v := range grid[i] {
 			if cur < v {
 				cur = v
 			}
 		}
-		leftRightSKyline = append(leftRightSKyline, cur)
+		leftRightSkyline = append(leftRightSkyline, cur)
 	}
 	for j := range grid {
 		cur := 0
@@ -81,7 +82,7 @@ func maxIncreaseKeepingSkyline(grid [][]int) int {
 	var ans int
 	for i := range grid {
 		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

Original file line number	Diff line number	Diff line change
`@@ -1,16 +1,17 @@`
`1`	`1`	`package leetcode`
`2`	`2`
`3`	`3`	`func maxIncreaseKeepingSkyline(grid [][]int) int {`
`4`		`- var topBottomSkyline []int`
`5`		`- var leftRightSKyline []int`
	`4`	`+ n := len(grid)`
	`5`	`+ topBottomSkyline := make([]int, 0, n)`
	`6`	`+ leftRightSkyline := make([]int, 0, n)`
`6`	`7`	`for i := range grid {`
`7`	`8`	`cur := 0`
`8`	`9`	`for _, v := range grid[i] {`
`9`	`10`	`if cur < v {`
`10`	`11`	`cur = v`
`11`	`12`	`}`
`12`	`13`	`}`
`13`		`- leftRightSKyline = append(leftRightSKyline, cur)`
	`14`	`+ leftRightSkyline = append(leftRightSkyline, cur)`
`14`	`15`	`}`
`15`	`16`	`for j := range grid {`
`16`	`17`	`cur := 0`
`@@ -24,7 +25,7 @@ func maxIncreaseKeepingSkyline(grid [][]int) int {`
`24`	`25`	`var ans int`
`25`	`26`	`for i := range grid {`
`26`	`27`	`for j := 0; j < len(grid[0]); j++ {`
`27`		`- ans += min(topBottomSkyline[j], leftRightSKyline[i]) - grid[i][j]`
	`28`	`+ ans += min(topBottomSkyline[j], leftRightSkyline[i]) - grid[i][j]`
`28`	`29`	`}`
`29`	`30`	`}`
`30`	`31`	`return ans`