feat: use the slices.Max function in golang code snippets

doocs · acbin · Nov 10, 2023 · Nov 10, 2023 · Nov 10, 2023 · Nov 10, 2023
commit 60a9dba0f729be3dee66a7090dd9ee91d63e12a5
diff --git a/lcp/LCP 33. 蓄水/README.md b/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
 	}

diff --git a/lcp/LCP 33. 蓄水/Solution.go b/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
 	}

diff --git a/lcp/LCP 50. 宝石补给/README.md b/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)
 }
 ```
 

diff --git a/lcp/LCP 50. 宝石补给/Solution.go b/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)
 }
diff --git a/lcp/LCP 68. 美观的花束/README.md b/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

diff --git a/lcp/LCP 68. 美观的花束/Solution.go b/lcp/LCP 68. 美观的花束/Solution.go
@@ -1,8 +1,5 @@
 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

diff --git a/solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/README.md b/solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/README.md
@@ -142,10 +142,7 @@ public:
 
 ```go
 func countTriplets(nums []int) (ans int) {
-	mx := 0
-	for _, x := range nums {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(nums)
 	cnt := make([]int, mx+1)
 	for _, x := range nums {
 		for _, y := range nums {

diff --git a/solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/README_EN.md b/solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/README_EN.md
@@ -123,10 +123,7 @@ public:
 
 ```go
 func countTriplets(nums []int) (ans int) {
-	mx := 0
-	for _, x := range nums {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(nums)
 	cnt := make([]int, mx+1)
 	for _, x := range nums {
 		for _, y := range nums {

diff --git a/solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/Solution.go b/solution/0900-0999/0982.Triples with Bitwise AND Equal To Zero/Solution.go
@@ -1,8 +1,5 @@
 func countTriplets(nums []int) (ans int) {
-	mx := 0
-	for _, x := range nums {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(nums)
 	cnt := make([]int, mx+1)
 	for _, x := range nums {
 		for _, y := range nums {

diff --git a/solution/1000-1099/1054.Distant Barcodes/README.md b/solution/1000-1099/1054.Distant Barcodes/README.md
@@ -125,10 +125,7 @@ public:
 
 ```go
 func rearrangeBarcodes(barcodes []int) []int {
-	mx := 0
-	for _, x := range barcodes {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(barcodes)
 	cnt := make([]int, mx+1)
 	for _, x := range barcodes {
 		cnt[x]++

diff --git a/solution/1000-1099/1054.Distant Barcodes/README_EN.md b/solution/1000-1099/1054.Distant Barcodes/README_EN.md
@@ -101,10 +101,7 @@ public:
 
 ```go
 func rearrangeBarcodes(barcodes []int) []int {
-	mx := 0
-	for _, x := range barcodes {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(barcodes)
 	cnt := make([]int, mx+1)
 	for _, x := range barcodes {
 		cnt[x]++

diff --git a/solution/1000-1099/1054.Distant Barcodes/Solution.go b/solution/1000-1099/1054.Distant Barcodes/Solution.go
@@ -1,8 +1,5 @@
 func rearrangeBarcodes(barcodes []int) []int {
-	mx := 0
-	for _, x := range barcodes {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(barcodes)
 	cnt := make([]int, mx+1)
 	for _, x := range barcodes {
 		cnt[x]++

diff --git a/solution/1300-1399/1300.Sum of Mutated Array Closest to Target/README.md b/solution/1300-1399/1300.Sum of Mutated Array Closest to Target/README.md
@@ -155,10 +155,9 @@ func findBestValue(arr []int, target int) (ans int) {
 	sort.Ints(arr)
 	n := len(arr)
 	s := make([]int, n+1)
-	mx := 0
+	mx := slices.Max(arr)
 	for i, x := range arr {
 		s[i+1] = s[i] + x
-		mx = max(mx, x)
 	}
 	diff := 1 << 30
 	for value := 0; value <= mx; value++ {

diff --git a/solution/1300-1399/1300.Sum of Mutated Array Closest to Target/README_EN.md b/solution/1300-1399/1300.Sum of Mutated Array Closest to Target/README_EN.md
@@ -138,10 +138,9 @@ func findBestValue(arr []int, target int) (ans int) {
 	sort.Ints(arr)
 	n := len(arr)
 	s := make([]int, n+1)
-	mx := 0
+	mx := slices.Max(arr)
 	for i, x := range arr {
 		s[i+1] = s[i] + x
-		mx = max(mx, x)
 	}
 	diff := 1 << 30
 	for value := 0; value <= mx; value++ {

diff --git a/solution/1300-1399/1300.Sum of Mutated Array Closest to Target/Solution.go b/solution/1300-1399/1300.Sum of Mutated Array Closest to Target/Solution.go
@@ -2,10 +2,9 @@ func findBestValue(arr []int, target int) (ans int) {
 	sort.Ints(arr)
 	n := len(arr)
 	s := make([]int, n+1)
-	mx := 0
+	mx := slices.Max(arr)
 	for i, x := range arr {
 		s[i+1] = s[i] + x
-		mx = max(mx, x)
 	}
 	diff := 1 << 30
 	for value := 0; value <= mx; value++ {

diff --git a/solution/1300-1399/1338.Reduce Array Size to The Half/README.md b/solution/1300-1399/1338.Reduce Array Size to The Half/README.md
@@ -133,10 +133,7 @@ public:
 
 ```go
 func minSetSize(arr []int) (ans int) {
-	mx := 0
-	for _, x := range arr {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(arr)
 	cnt := make([]int, mx+1)
 	for _, x := range arr {
 		cnt[x]++

diff --git a/solution/1300-1399/1338.Reduce Array Size to The Half/README_EN.md b/solution/1300-1399/1338.Reduce Array Size to The Half/README_EN.md
@@ -117,10 +117,7 @@ public:
 
 ```go
 func minSetSize(arr []int) (ans int) {
-	mx := 0
-	for _, x := range arr {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(arr)
 	cnt := make([]int, mx+1)
 	for _, x := range arr {
 		cnt[x]++

diff --git a/solution/1300-1399/1338.Reduce Array Size to The Half/Solution.go b/solution/1300-1399/1338.Reduce Array Size to The Half/Solution.go
@@ -1,8 +1,5 @@
 func minSetSize(arr []int) (ans int) {
-	mx := 0
-	for _, x := range arr {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(arr)
 	cnt := make([]int, mx+1)
 	for _, x := range arr {
 		cnt[x]++

diff --git a/solution/1700-1799/1733.Minimum Number of People to Teach/README.md b/solution/1700-1799/1733.Minimum Number of People to Teach/README.md
@@ -208,11 +208,7 @@ func minimumTeachings(n int, languages [][]int, friendships [][]int) int {
 			cnt[l]++
 		}
 	}
-	mx := 0
-	for _, v := range cnt {
-		mx = max(mx, v)
-	}
-	return len(s) - mx
+	return len(s) - slices.Max(cnt)
 }
 ```
 

diff --git a/solution/1700-1799/1733.Minimum Number of People to Teach/README_EN.md b/solution/1700-1799/1733.Minimum Number of People to Teach/README_EN.md
@@ -189,11 +189,7 @@ func minimumTeachings(n int, languages [][]int, friendships [][]int) int {
 			cnt[l]++
 		}
 	}
-	mx := 0
-	for _, v := range cnt {
-		mx = max(mx, v)
-	}
-	return len(s) - mx
+	return len(s) - slices.Max(cnt)
 }
 ```
 

diff --git a/solution/1700-1799/1733.Minimum Number of People to Teach/Solution.go b/solution/1700-1799/1733.Minimum Number of People to Teach/Solution.go
@@ -25,9 +25,5 @@ func minimumTeachings(n int, languages [][]int, friendships [][]int) int {
 			cnt[l]++
 		}
 	}
-	mx := 0
-	for _, v := range cnt {
-		mx = max(mx, v)
-	}
-	return len(s) - mx
+	return len(s) - slices.Max(cnt)
 }
diff --git a/solution/1800-1899/1819.Number of Different Subsequences GCDs/README.md b/solution/1800-1899/1819.Number of Different Subsequences GCDs/README.md
@@ -153,10 +153,7 @@ public:
 
 ```go
 func countDifferentSubsequenceGCDs(nums []int) (ans int) {
-	mx := 0
-	for _, x := range nums {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(nums)
 	vis := make([]bool, mx+1)
 	for _, x := range nums {
 		vis[x] = true

diff --git a/solution/1800-1899/1819.Number of Different Subsequences GCDs/README_EN.md b/solution/1800-1899/1819.Number of Different Subsequences GCDs/README_EN.md
@@ -133,10 +133,7 @@ public:
 
 ```go
 func countDifferentSubsequenceGCDs(nums []int) (ans int) {
-	mx := 0
-	for _, x := range nums {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(nums)
 	vis := make([]bool, mx+1)
 	for _, x := range nums {
 		vis[x] = true

diff --git a/solution/1800-1899/1819.Number of Different Subsequences GCDs/Solution.go b/solution/1800-1899/1819.Number of Different Subsequences GCDs/Solution.go
@@ -1,8 +1,5 @@
 func countDifferentSubsequenceGCDs(nums []int) (ans int) {
-	mx := 0
-	for _, x := range nums {
-		mx = max(mx, x)
-	}
+	mx := slices.Max(nums)
 	vis := make([]bool, mx+1)
 	for _, x := range nums {
 		vis[x] = true

diff --git a/solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/README.md b/solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/README.md
@@ -135,10 +135,7 @@ public:
 
 ```go
 func longestSubarray(nums []int) int {
-	mx := 0
-	for _, v := range nums {
-		mx = max(mx, v)
-	}
+	mx := slices.Max(nums)
 	ans, cnt := 0, 0
 	for _, v := range nums {
 		if v == mx {

diff --git a/solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/README_EN.md b/solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/README_EN.md
@@ -115,10 +115,7 @@ public:
 
 ```go
 func longestSubarray(nums []int) int {
-	mx := 0
-	for _, v := range nums {
-		mx = max(mx, v)
-	}
+	mx := slices.Max(nums)
 	ans, cnt := 0, 0
 	for _, v := range nums {
 		if v == mx {

diff --git a/solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/Solution.go b/solution/2400-2499/2419.Longest Subarray With Maximum Bitwise AND/Solution.go
@@ -1,8 +1,5 @@
 func longestSubarray(nums []int) int {
-	mx := 0
-	for _, v := range nums {
-		mx = max(mx, v)
-	}
+	mx := slices.Max(nums)
 	ans, cnt := 0, 0
 	for _, v := range nums {
 		if v == mx {