Programmers :: Heap(힙) 더 맵게 레벨2

풀이

import java.util.Arrays;
 import java.util.PriorityQueue;
 import java.util.stream.Collectors;

class Solution{
    public int solution(int[] scoville, int K){
        int count = 0;
        int firstLowest;
        int secondLowest;
        int combinedTwoLowestFoods;

        PriorityQueue<Integer> priorityQueueLowest = new PriorityQueue<>(Arrays.stream(scoville).boxed().collect(Collectors.toList()));

        while(true){
            if(priorityQueueLowest.size() == 1 || priorityQueueLowest.size() == 0) return -1;
            count++;
            firstLowest = priorityQueueLowest.poll();
            secondLowest = priorityQueueLowest.poll();
            combinedTwoLowestFoods = firstLowest + secondLowest*2;
            priorityQueueLowest.add(combinedTwoLowestFoods);
            if(K <= priorityQueueLowest.peek()) return count;
        }
    }
}

---

출처

코딩테스트 연습 - 더 맵게