fix: code

doocs · Oct 31, 2023 · 791552d · 791552d
1 parent babd4e5
commit 791552d
Show file tree

Hide file tree

Showing 3 changed files with 6 additions and 6 deletions.
diff --git a/...n/2900-2999/2919.Minimum Increment Operations to Make Array Beautiful/README.md b/...n/2900-2999/2919.Minimum Increment Operations to Make Array Beautiful/README.md
@@ -151,9 +151,9 @@ public:
 func minIncrementOperations(nums []int, k int) int64 {
 	var f, g, h int
 	for _, x := range nums {
-		f, g, h = g, h, min(min(f, g), h)+max(k-x, 0)
+		f, g, h = g, h, min(f, g, h)+max(k-x, 0)
 	}
-	return int64(min(min(f, g), h))
+	return int64(min(f, g, h))
 }
 ```
 

diff --git a/...900-2999/2919.Minimum Increment Operations to Make Array Beautiful/README_EN.md b/...900-2999/2919.Minimum Increment Operations to Make Array Beautiful/README_EN.md
@@ -141,9 +141,9 @@ public:
 func minIncrementOperations(nums []int, k int) int64 {
 	var f, g, h int
 	for _, x := range nums {
-		f, g, h = g, h, min(min(f, g), h)+max(k-x, 0)
+		f, g, h = g, h, min(f, g, h)+max(k-x, 0)
 	}
-	return int64(min(min(f, g), h))
+	return int64(min(f, g, h))
 }
 ```
 

diff --git a/solution/2900-2999/2919.Minimum Increment Operations to Make Array Beautiful/Solution.go b/solution/2900-2999/2919.Minimum Increment Operations to Make Array Beautiful/Solution.go
@@ -1,7 +1,7 @@
 func minIncrementOperations(nums []int, k int) int64 {
 	var f, g, h int
 	for _, x := range nums {
-		f, g, h = g, h, min(min(f, g), h)+max(k-x, 0)
+		f, g, h = g, h, min(f, g, h)+max(k-x, 0)
 	}
-	return int64(min(min(f, g), h))
+	return int64(min(f, g, h))
 }