_1675.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.TreeSet;

publicclass_1675 {
publicstaticclassSolution1 {
publicintminimumDeviation(int[] nums) {
TreeSet<Integer> treeSet = newTreeSet<>();
for (intnum : nums) {
if (num % 2 == 1) {
treeSet.add(num * 2);
 } else {
treeSet.add(num);
 }
 }
intminDev = 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());
 }
returnminDev;
 }
 }
}