큐 - 프린터 / 파이썬

from collections import deque

def solution(priorities, location):
    lst = [i for i in range(len(priorities))]
    pri = deque(priorities)
    loc = deque(lst)
    answer = 0
    while True:
        front = pri.popleft()
        l = loc.popleft()
        if pri and front < max(pri):
            pri.append(front)
            loc.append(l)
        else:
            answer += 1
            if l == location:
                break
    return answer

 

다른 풀이

def solution(priorities, location):
  answer = 0
  from collections import deque

  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 answe

 

programmers.co.kr/learn/courses/30/lessons/42587#

코딩테스트 연습 - 프린터