feat: use the built-in slices.Min/Max functions in Go 1.21.0+ (doocs#1936)

Author: yanglbme

lcp/LCP 34. 二叉树染色/README.md

@@ -172,25 +172,15 @@ func maxValue(root *TreeNode, k int) int {
 		}
 		l := dfs(node.Left)
 		r := dfs(node.Right)
-		ans[0] = max(l...) + max(r...)
+		ans[0] = slices.Max(l) + slices.Max(r)
 		for i := 0; i < k; i++ {
 			for j := 0; j < k-i; j++ {
 				ans[i+j+1] = max(ans[i+j+1], l[i]+r[j]+node.Val)
 			}
 		}
 		return ans
 	}
-	return max(dfs(root)...)
-}
-
-func max(nums ...int) int {
-	ans := nums[0]
-	for _, x := range nums {
-		if x > ans {
-			ans = x
-		}
-	}
-	return ans
+	return slices.Max(dfs(root))
 }
 ```
 

lcp/LCP 34. 二叉树染色/Solution.go

@@ -15,23 +15,13 @@ func maxValue(root *TreeNode, k int) int {
 		}
 		l := dfs(node.Left)
 		r := dfs(node.Right)
-		ans[0] = max(l...) + max(r...)
+		ans[0] = slices.Max(l) + slices.Max(r)
 		for i := 0; i < k; i++ {
 			for j := 0; j < k-i; j++ {
 				ans[i+j+1] = max(ans[i+j+1], l[i]+r[j]+node.Val)
 			}
 		}
 		return ans
 	}
-	return max(dfs(root)...)
-}
-
-func max(nums ...int) int {
-	ans := nums[0]
-	for _, x := range nums {
-		if x > ans {
-			ans = x
-		}
-	}
-	return ans
+	return slices.Max(dfs(root))
 }

solution/1700-1799/1787.Make the XOR of All Segments Equal to Zero/README.md

@@ -196,7 +196,7 @@ func minChanges(nums []int, k int) int {
 	}
 	for i, sz := range size {
 		g := make([]int, n)
-		x := min(f...) + sz
+		x := slices.Min(f) + sz
 		for i := range g {
 			g[i] = x
 		}
@@ -209,16 +209,6 @@ func minChanges(nums []int, k int) int {
 	}
 	return f[0]
 }
-
-func min(a ...int) int {
-	mi := a[0]
-	for _, v := range a {
-		if mi > v {
-			mi = v
-		}
-	}
-	return mi
-}
 ```
 
 ### **...**

solution/1700-1799/1787.Make the XOR of All Segments Equal to Zero/README_EN.md

@@ -158,7 +158,7 @@ func minChanges(nums []int, k int) int {
 	}
 	for i, sz := range size {
 		g := make([]int, n)
-		x := min(f...) + sz
+		x := slices.Min(f) + sz
 		for i := range g {
 			g[i] = x
 		}
@@ -171,16 +171,6 @@ func minChanges(nums []int, k int) int {
 	}
 	return f[0]
 }
-
-func min(a ...int) int {
-	mi := a[0]
-	for _, v := range a {
-		if mi > v {
-			mi = v
-		}
-	}
-	return mi
-}
 ```
 
 ### **...**

solution/1700-1799/1787.Make the XOR of All Segments Equal to Zero/Solution.go

@@ -15,7 +15,7 @@ func minChanges(nums []int, k int) int {
 	}
 	for i, sz := range size {
 		g := make([]int, n)
-		x := min(f...) + sz
+		x := slices.Min(f) + sz
 		for i := range g {
 			g[i] = x
 		}
@@ -27,14 +27,4 @@ func minChanges(nums []int, k int) int {
 		f = g
 	}
 	return f[0]
-}
-
-func min(a ...int) int {
-	mi := a[0]
-	for _, v := range a {
-		if mi > v {
-			mi = v
-		}
-	}
-	return mi
 }