add 2357

fishercoder1534 · fishercoder1534 · commit e04257b1a937 · 2022-07-31T09:41:01.000-07:00
diff --git a/README.md b/README.md
@@ -8,7 +8,8 @@ _If you like this project, please leave me a star._ &#9733;
 
 | #    |      Title     | Solutions                                                                                                                                | Video                                                                         | Difficulty                       | Tag                  
 |------|----------------|------------------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|----------------------------------|-------------
-| 2352 |[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2352.java)                                                                     || Medium                                                                          ||
+| 2357 |[Make Array Zero by Subtracting Equal Amounts](https://leetcode.com/problems/make-array-zero-by-subtracting-equal-amounts/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2357.java)                                                                     || Easy                                                                             ||
+| 2352 |[Equal Row and Column Pairs](https://leetcode.com/problems/equal-row-and-column-pairs/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2352.java)                                                                     || Medium                                                                        ||
 | 2351 |[First Letter to Appear Twice](https://leetcode.com/problems/first-letter-to-appear-twice/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2351.java)                                                                     || Easy                                                                          ||
 | 2347 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/best-poker-hand/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2347.java)                                                                     || Easy                                                                          ||
 | 2341 |[Maximum Number of Pairs in Array](https://leetcode.com/problems/maximum-number-of-pairs-in-array/)| [Java](../master/src/main/java/com/fishercoder/solutions/_2341.java)                                                                     || Easy                                                                          ||
diff --git a/src/main/java/com/fishercoder/solutions/_2357.java b/src/main/java/com/fishercoder/solutions/_2357.java
@@ -0,0 +1,27 @@
+package com.fishercoder.solutions;
+
+import java.util.TreeSet;
+
+public class _2357 {
+    public static class Solution1 {
+        public int minimumOperations(int[] nums) {
+            TreeSet<Integer> treeSet = new TreeSet<>();
+            for (int num : nums) {
+                if (num > 0) {
+                    treeSet.add(num);
+                }
+            }
+            int ops = 0;
+            while (!treeSet.isEmpty()) {
+                int min = treeSet.pollFirst();
+                ops++;
+                TreeSet<Integer> tmp = new TreeSet<>();
+                while (!treeSet.isEmpty()) {
+                    tmp.add(treeSet.pollFirst() - min);
+                }
+                treeSet.addAll(tmp);
+            }
+            return ops;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_2357Test.java b/src/test/java/com/fishercoder/_2357Test.java
@@ -0,0 +1,24 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2357;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2357Test {
+    private static _2357.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2357.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 5, 0, 3, 5};
+        assertEquals(3, solution1.minimumOperations(nums));
+    }
+
+}
