LC.P2208[将数组和减半的最少操作次数]

发表于2023-07-25|更新于2023-07-25|LeetCode

|字数总计:105|阅读时长:1分钟|阅读量:

方法一：贪心+优先队列

class Solution {
    public int halveArray(int[] nums) {
        int ans = 0;
        PriorityQueue<Double> q = new PriorityQueue<>((a, b) -> b.compareTo(a));
        double sum = 0, newSum = 0;
        for (int num : nums) {
            q.offer((double) num);
            sum += num;
        }
        while (newSum < sum / 2) {
            double x = q.poll();
            newSum += x / 2;
            q.offer(x / 2);
            ++ans;
        }
        return ans;
    }
}