느낌표 공장

from collections import deque def dictionary() : dic = {} for i in range(1, 27) : dic[chr(64+i)] = i return dic def solution(msg): dic = dictionary() idx = [] msg = deque(msg) last = 26 w = msg.popleft() d = True while msg : c = msg.popleft() if w+c in dic : while True : w = w+c try : c = msg.popleft() except : d = False break if w+c not in dic : break last += 1 dic[w+c] = last idx.append(dic[w]..

from collections import deque def solution(bridge_length, weight, truck_weights): truck_weights = deque(truck_weights) passing = deque([0] * bridge_length) time = 0 bridge_w = 0 while passing: time += 1 move = passing.popleft() # 다리를 완전히 지나간 트럭이 있었을 경우(move = 다리를 빠져나간 트럭 / 일 경우) if move != 0 : bridge_w -= move if truck_weights: if bridge_w + truck_weights[0]

from collections import deque def solution(dartResult): dartResult = dartResult.replace('10', 'p') dartResult = dartResult.replace('S', '1') dartResult = dartResult.replace('D', '2') dartResult = dartResult.replace('T', '3') queue = deque(list(dartResult)) answer = [] while queue : x = queue.popleft() if x != '*' and x !='#' : y = queue.popleft() if x == 'p' : score = 10 ** int(y) else : score =..

def solution(priorities, location): answer = 0 printer = [(i, j) for i, j in enumerate(priorities)] while True : x = printer.pop(0) if any(x[1] < q[1] for q in printer) : printer.append(x) else : answer += 1 if x[0] == location : return answer 1. 입력받은 priorities를 enumerate를 이용하여 인덱스와 우선순위를 튜플로 printer 리스트 에 넣어준다. ex) priorities = [1, 2, 3, 1] 이면 printer = [(0,1), (1, 2), (2, 3), (3, 1)] 이 됨 2. p..