[프로그래머스] 프로세스 - python

문제 정보

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

프로그래머스

문제 유형 : 큐

난이도 : level 2

 

코드 

(인덱스, 값) 이렇게 튜플 구조로 큐에 넣어서 풀었음

from collections import deque

def solution(priorities, location):
    answer = 0
    arr = []
        
    q = deque([])
    
    for i in range(len(priorities)):
        q.append((i, priorities[i]))
    
    while q:
        v = q.popleft()
        
        if len(q) == 0:
            arr.append(v)
            break
        
        li = sorted(q, key = lambda x : x[1], reverse=True)
        
        if v[1] >= li[0][1]:
            arr.append(v)
        else:
            q.append(v)
    
    for i in range(len(arr)):
        if arr[i][0] == location:
            answer = i+1
    return answer

 

다른 사람 풀이

def solution(priorities, location):
    queue =  [(i,p) for i,p in enumerate(priorities)]
    answer = 0
    while True:
        cur = queue.pop(0)
        if any(cur[1] < q[1] for q in queue):
            queue.append(cur)
        else:
            answer += 1
            if cur[0] == location:
                return answer

python any(), all() : https://otugi.tistory.com/206

• any() : 하나라도 True인게 있으면 True
• all() : 모두 True여야 True 반환