feat: use the slices.Min/Max functions in golang code snippets (doocs#1951)

Author: yanglbme

lcci/08.13.Pile Box/README.md

@@ -108,7 +108,7 @@ public:
 ### **Go**
 
 ```go
-func pileBox(box [][]int) (ans int) {
+func pileBox(box [][]int) int {
 	sort.Slice(box, func(i, j int) bool {
 		a, b := box[i], box[j]
 		return a[0] < b[0] || (a[0] == b[0] && b[1] < a[1])
@@ -122,9 +122,8 @@ func pileBox(box [][]int) (ans int) {
 			}
 		}
 		f[i] += box[i][2]
-		ans = max(ans, f[i])
 	}
-	return
+	return slices.Max(f)
 }
 ```
 

lcci/08.13.Pile Box/README_EN.md

@@ -98,7 +98,7 @@ public:
 ### **Go**
 
 ```go
-func pileBox(box [][]int) (ans int) {
+func pileBox(box [][]int) int {
 	sort.Slice(box, func(i, j int) bool {
 		a, b := box[i], box[j]
 		return a[0] < b[0] || (a[0] == b[0] && b[1] < a[1])
@@ -112,9 +112,8 @@ func pileBox(box [][]int) (ans int) {
 			}
 		}
 		f[i] += box[i][2]
-		ans = max(ans, f[i])
 	}
-	return
+	return slices.Max(f)
 }
 ```
 

lcci/08.13.Pile Box/Solution.go

@@ -1,4 +1,4 @@
-func pileBox(box [][]int) (ans int) {
+func pileBox(box [][]int) int {
 	sort.Slice(box, func(i, j int) bool {
 		a, b := box[i], box[j]
 		return a[0] < b[0] || (a[0] == b[0] && b[1] < a[1])
@@ -12,7 +12,6 @@ func pileBox(box [][]int) (ans int) {
 			}
 		}
 		f[i] += box[i][2]
-		ans = max(ans, f[i])
 	}
-	return
+	return slices.Max(f)
 }

lcof2/剑指 Offer II 073. 狒狒吃香蕉/README.md

@@ -132,11 +132,7 @@ public:
 
 ```go
 func minEatingSpeed(piles []int, h int) int {
-	mx := 0
-	for _, pile := range piles {
-		mx = max(mx, pile)
-	}
-	left, right := 1, mx
+	left, right := 1, slices.Max(piles)
 	for left < right {
 		mid := (left + right) >> 1
 		s := 0

lcof2/剑指 Offer II 073. 狒狒吃香蕉/Solution.go

@@ -1,9 +1,5 @@
 func minEatingSpeed(piles []int, h int) int {
-	mx := 0
-	for _, pile := range piles {
-		mx = max(mx, pile)
-	}
-	left, right := 1, mx
+	left, right := 1, slices.Max(piles)
 	for left < right {
 		mid := (left + right) >> 1
 		s := 0

lcp/LCP 33. 蓄水/README.md

@@ -125,10 +125,7 @@ public:
 
 ```go
 func storeWater(bucket []int, vat []int) int {
-	mx := 0
-	for _, x := range vat {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(vat)
 	if mx == 0 {
 		return 0
 	}

lcp/LCP 33. 蓄水/Solution.go

@@ -1,8 +1,5 @@
 func storeWater(bucket []int, vat []int) int {
-	mx := 0
-	for _, x := range vat {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(vat)
 	if mx == 0 {
 		return 0
 	}

lcp/LCP 50. 宝石补给/README.md

@@ -131,12 +131,7 @@ func giveGem(gem []int, operations [][]int) int {
 		gem[y] += v
 		gem[x] -= v
 	}
-	mx, mi := 0, 1<<30
-	for _, x := range gem {
-		mx = max(mx, x)
-		mi = min(mi, x)
-	}
-	return mx - mi
+	return slices.Max(gem) - slices.Min(gem)
 }
 ```
 

lcp/LCP 50. 宝石补给/Solution.go

@@ -5,10 +5,5 @@ func giveGem(gem []int, operations [][]int) int {
 		gem[y] += v
 		gem[x] -= v
 	}
-	mx, mi := 0, 1<<30
-	for _, x := range gem {
-		mx = max(mx, x)
-		mi = min(mi, x)
-	}
-	return mx - mi
+	return slices.Max(gem) - slices.Min(gem)
 }

lcp/LCP 68. 美观的花束/README.md

@@ -128,10 +128,7 @@ public:
 
 ```go
 func beautifulBouquet(flowers []int, cnt int) (ans int) {
-	mx := 0
-	for _, x := range flowers {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(flowers)
 	d := make([]int, mx+1)
 	j := 0
 	const mod = 1e9 + 7