fix: cpp code

doocs · Jun 23, 2024 · e42cac0 · e42cac0
1 parent 0c4be32
commit e42cac0
Show file tree

Hide file tree

Showing 3 changed files with 15 additions and 12 deletions.
diff --git a/.../3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md b/.../3190.Find Minimum Operations to Make All Elements Divisible by Three/README.md
@@ -102,17 +102,18 @@ class Solution {
 
 ```cpp
 class Solution {
-    public int minimumOperations(int[] nums) {
+public:
+    int minimumOperations(vector<int>& nums) {
         int ans = 0;
         for (int x : nums) {
             int mod = x % 3;
-            if (mod != 0) {
-                ans += Math.min(mod, 3 - mod);
+            if (mod) {
+                ans += min(mod, 3 - mod);
             }
         }
         return ans;
     }
-}
+};
 ```
 
 #### Go

diff --git a/...90.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md b/...90.Find Minimum Operations to Make All Elements Divisible by Three/README_EN.md
@@ -100,17 +100,18 @@ class Solution {
 
 ```cpp
 class Solution {
-    public int minimumOperations(int[] nums) {
+public:
+    int minimumOperations(vector<int>& nums) {
         int ans = 0;
         for (int x : nums) {
             int mod = x % 3;
-            if (mod != 0) {
-                ans += Math.min(mod, 3 - mod);
+            if (mod) {
+                ans += min(mod, 3 - mod);
             }
         }
         return ans;
     }
-}
+};
 ```
 
 #### Go

diff --git a/...00-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/Solution.cpp b/...00-3199/3190.Find Minimum Operations to Make All Elements Divisible by Three/Solution.cpp
@@ -1,12 +1,13 @@
 class Solution {
-    public int minimumOperations(int[] nums) {
+public:
+    int minimumOperations(vector<int>& nums) {
         int ans = 0;
         for (int x : nums) {
             int mod = x % 3;
-            if (mod != 0) {
-                ans += Math.min(mod, 3 - mod);
+            if (mod) {
+                ans += min(mod, 3 - mod);
             }
         }
         return ans;
     }
-}
+};