PROGRAMMERS 42587: 프린터

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

---

Python

def solution(priorities, location):
    stack = []
    for idx, val in enumerate(priorities):
        priorities[idx] = [idx, val]
 
    while len(priorities):
        value = priorities.pop(0)
        for i in priorities:
            if value[1] < i[1]:
                priorities.append(value)
                break
        else:
            stack.append(value)
 
    for idx, val in enumerate(stack):
        if val[0] == location:
            return idx + 1

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com