leetcode1705. 吃苹果的最大数目

姐姐的半熟芝士

关注

最新推荐文章于 2025-03-13 13:52:36 发布 · 687 阅读

原创 ·

本内容遵循 CC 4.0 BY-SA 版权协议

java：

平安夜每日一题贪心+优先队列～谢谢官方题解

class Solution {
    public int eatenApples(int[] apples, int[] days) {
        int ans = 0;
        PriorityQueue<int[]> pq = new PriorityQueue<int[]>((a, b) -> a[0] - b[0]);
        int n = apples.length;
        int i = 0;
        while(i < n){
            while(!pq.isEmpty() && pq.peek()[0] <= i){
                pq.poll();
            }
            int rottenDay = i + days[i];
            int count = apples[i];
            if(count > 0){
                pq.offer(new int[]{rottenDay, count});
            }
            if(!pq.isEmpty()){
                int[] arr = pq.peek();
                arr[1]--;
                if(arr[1] == 0){
                    pq.poll();
                }
                ans ++;
            }
            i ++;
        }
        while(!pq.isEmpty()){
            while(!pq.isEmpty() && pq.peek()[0] <= i){
                pq.poll();
            }
            if(pq.isEmpty()){
                break;
            }
            int[] arr = pq.poll();
            int curr = Math.min(arr[0] - i, arr[1]);
            ans += curr;
            i += curr;
        }
        return ans;
    }
}

收录于