PROGRAMMERS 42628: 이중우선순위큐

Link : programmers.co.kr/learn/courses/30/lessons/42628

---

Python

import heapq
 
 
def solution(operations):
    heap = []
    for i in operations:
        opcode, operand = i.split(' ')
        if opcode == "I":
            heapq.heappush(heap, int(operand))
        elif opcode == "D":
            if len(heap) > 0:
                if operand == "1":
                    heap.pop()
                else:
                    heapq.heappop(heap)
    return [max(heap), min(heap)] if len(heap) > 0 else [0, 0]

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com