[프로그래머스] 이중우선순위큐 - JAVA

문제

https://school.programmers.co.kr/learn/courses/30/lessons/42628

프로그래머스

 

코드

import java.util.*;

class Solution {
    public int[] solution(String[] operations) {
        List<Integer> pq = new LinkedList<>();

        
        for(int i=0;i<operations.length;i++){
            String arr [] = operations[i].split(" ");

            if(arr[0].equals("I")){
                pq.add(Integer.parseInt(arr[1]));
            }
            else{
                if(pq.isEmpty()) continue;
                if(arr[1].equals("1")){
                    pq.remove(pq.size()-1);
                }
                else{
                    pq.remove(0);
                }
            }
            
            Collections.sort(pq);
            
        }
        
        if(pq.isEmpty()){
            return new int[] {0,0};
        }
        else{
            return new int [] { pq.get(pq.size()-1), pq.get(0)};
        }
        
    }
}