Minimize Deviation in Array LeetCode solution in Java

1
class Solution {
2
  public int minimumDeviation(int[] nums) {
3
    TreeSet<Integer> temp = new TreeSet<>();
4
    for (int i : nums) {
5
      if (i % 2 == 0) {
6
        temp.add(i);
7
      } else {
8
        temp.add(i * 2);
9
      }
10
    }
11

12
    int md = temp.last() - temp.first();
13
    int m = 0;
14

15
    while (temp.size() > 0 && temp.last() % 2 == 0) {
16
      m = temp.last();
17
      temp.remove(m);
18
      temp.add(m / 2);
19

20
      md = Math.min(md, temp.last() - temp.first());
21
    }
22
    return md;
23
  }
24
}