2022.07.10(LC_6112_装满杯子需要的最短总时长)

方法一：优先队列

class Solution {
    public int fillCups(int[] amount) {
        int ans = 0;
        Queue<Integer> q = new PriorityQueue<>((o1, o2) -> o2 - o1);
        for (int a : amount) {
            if (a != 0) {
               q.offer(a); 
            }
        }
        while (!q.isEmpty()) {
            if (q.size() >= 2) {
                int w1 = q.poll();
                int w2 = q.poll();
                if (w1 >= 1 && w2 >= 1) {
                    ans++;
                    if (w2 - 1 != 0) {
                       q.offer(w2 - 1); 
                    }
                    if (w1 - 1 != 0) {
                       q.offer(w1 - 1); 
                    }
                } else if (w1 == 1){
                    ans++;
                } else if (w2 == 1) {
                    ans++;
                } 
            } else {
                int w = q.poll();
                if (w >= 1) {
                    ans++;
                    if (w - 1 != 0) {
                       q.offer(w - 1); 
                    }
                } else if (w == 1) {
                    ans++;
                }
            }
            
        } 
        return ans;
    }  

}

 方法二：

 //注：不管remainder是奇数还是偶数，都可以统一写成如下形式
            //转换过程：首先(remainder - 1) / 2 + 1 + amount[2]转换后就是以下形式
            //然后remainder / 2 + amount[2]先写成(amount[0] + amount[1] + amount[2]) / 2
            //由于remainder是偶数，2amount[2]也是偶数，所以amount[0] + amount[1] + amount[2]也是偶数
            //则amount[0] + amount[1] + amount[2] + 1下取整的值不变，如4/2，5/2
            //return (amount[0] + amount[1] + amount[2] + 1) / 2; 

class Solution {
    public int fillCups(int[] amount) {
        Arrays.sort(amount);
        if (amount[0] + amount[1] <= amount[2]) {
            return amount[2];
        } else {
            int remainder = amount[0] + amount[1] - amount[2];
            if (remainder % 2 == 0) {
                return remainder / 2 + amount[2];
            } else {
                return (remainder - 1) / 2 + 1 + amount[2];
            }
            //return (amount[0] + amount[1] + amount[2] + 1) / 2;
        }
    }
}