[Python] 프린터

630 단어 algorithmalgorithm

2 Try 필수


1 Try

from collections import deque

def solution(priorities, location):
    answer = 0
    d = deque([(v,i) for i,v in enumerate(priorities)])
    while len(d):
        item = d.popleft()
        if d and max(d)[0] > item[0]:
            d.append(item)
        else:
            answer += 1
            if item[1] == location:
                break
    return answer

좋은 웹페이지 즐겨찾기