Minimum Operations to Halve Array Sum LeetCode solution in Java

1
class Solution {
2
  public int halveArray(int[] nums) {
3
    PriorityQueue<Double> q = new PriorityQueue<>(Collections.reverseOrder());
4
    double sum = 0;
5
    for (int i : nums) {
6
      sum += (double) i;
7
      q.add((double) i);
8
    }
9
    int res = 0;
10
    double req = sum;
11
    while (sum > req / 2) {
12
      double curr = q.poll();
13
      q.add(curr / 2);
14
      res++;
15
      sum -= curr / 2;
16
    }
17
    return res;
18
  }
19
}