add 1675

Author: fishercoder1534

README.md

@@ -31,6 +31,7 @@ _If you like this project, please leave me a star._ ★
 |1680|[Concatenation of Consecutive Binary Numbers](https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1680.java) ||Medium|Math|
 |1679|[Max Number of K-Sum Pairs](https://leetcode.com/problems/max-number-of-k-sum-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1679.java) ||Medium|HashTable|
 |1678|[Goal Parser Interpretation](https://leetcode.com/problems/goal-parser-interpretation/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1678.java) ||Easy|String|
+|1675|[Minimize Deviation in Array](https://leetcode.com/problems/minimize-deviation-in-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1675.java) ||Hard|Heap, Ordered Map|
 |1673|[Find the Most Competitive Subsequence](https://leetcode.com/problems/find-the-most-competitive-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1673.java) ||Medium|Stack, Greedy|
 |1672|[Richest Customer Wealth](https://leetcode.com/problems/richest-customer-wealth/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1672.java) ||Easy|Array|
 |1669|[Merge In Between Linked Lists](https://leetcode.com/problems/merge-in-between-linked-lists/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1669.java) ||Medium|LinedList|

src/main/java/com/fishercoder/solutions/_1675.java

@@ -0,0 +1,25 @@
+package com.fishercoder.solutions;
+
+import java.util.TreeSet;
+
+public class _1675 {
+    public static class Solution1 {
+        public int minimumDeviation(int[] nums) {
+            TreeSet<Integer> treeSet = new TreeSet<>();
+            for (int num : nums) {
+                if (num % 2 == 1) {
+                    treeSet.add(num * 2);
+                } else {
+                    treeSet.add(num);
+                }
+            }
+            int minDev = treeSet.last() - treeSet.first();
+            while (treeSet.last() % 2 == 0) {
+                treeSet.add(treeSet.last() / 2);
+                treeSet.remove(treeSet.last());
+                minDev = Math.min(minDev, treeSet.last() - treeSet.first());
+            }
+            return minDev;
+        }
+    }
+}

src/test/java/com/fishercoder/_1675Test.java

@@ -0,0 +1,23 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1675;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1675Test {
+    private static _1675.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1675.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(1, solution1.minimumDeviation(new int[]{1, 2, 3, 4}));
+    }
+
+}