프로그래머스 - 힙 - 더 맵게

programmers.co.kr/learn/courses/30/lessons/42626

코딩테스트 연습 - 더 맵게

import java.util.PriorityQueue;

public class 더_맵게 {
    public static void main(String[] args) {
        더_맵게 o = new 더_맵게();
        System.out.println(o.solution(new int[]{1, 2, 3, 9, 10, 12}, 1000000000));
    }

    public int solution(int[] scoville, int K) {
        PriorityQueue<Integer> q = new PriorityQueue<>();
        for(int i=0; i<scoville.length; i++) {
            q.offer(scoville[i]);
        }

        int count = 0;
        while (q.peek() < K) {
            Integer food1 = q.poll();
            Integer food2 = q.poll();

            if(food2 == null) {
                return -1;
            }

            Integer newFood = food1 + (food2 * 2);
            q.offer(newFood);
            count++;
        }

        return count;
    }
}

 

알고리즘

• 힙
• 우선순위 큐 활용문제