add 2033

fishercoder1534 · fishercoder1534 · commit 34703ecaf615 · 2021-10-09T21:21:49.000-07:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2033|[Minimum Operations to Make a Uni-Value Grid](https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2033.java) ||Medium||
 |2032|[Two Out of Three](https://leetcode.com/problems/two-out-of-three/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2032.java) ||Easy||
 |2028|[Find Missing Observations](https://leetcode.com/problems/find-missing-observations/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2028.java) ||Medium||
 |2027|[Minimum Moves to Convert String](https://leetcode.com/problems/minimum-moves-to-convert-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2027.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2033.java b/src/main/java/com/fishercoder/solutions/_2033.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+public class _2033 {
+    public static class Solution1 {
+        public int minOperations(int[][] grid, int x) {
+            List<Integer> list = new ArrayList<>();
+            for (int i = 0; i < grid.length; i++) {
+                for (int j = 0; j < grid[0].length; j++) {
+                    list.add(grid[i][j]);
+                }
+            }
+            if (list.size() <= 1) {
+                return 0;
+            }
+            Collections.sort(list);
+            int median = list.get(list.size() / 2);
+            int ops = 0;
+            for (int i = 0; i < list.size(); i++) {
+                int diff = Math.abs(list.get(i) - median);
+                if (diff % x != 0) {
+                    return -1;
+                }
+                ops += diff;
+            }
+            return ops / x;
+        }
+    }
+}
