느낌표 공장

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(cacheSize, cities): cache = deque([], maxlen=cacheSize) time = 0 if cacheSize == 0 : return len(cities) * 5 for city in cities : city = city.lower() if city in cache : cache.remove(city) cache.append(city) time +=1 else : cache.append(city) time += 5 return time 풀이 1) 초기 설정 및 cacheSize가 0인경우 from collections import deque def solution(cacheSize, cities):..

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(s): if len(s) % 2 == 1 : return 0 s = deque(s) temp = [] i = s.popleft() while s : j = s.popleft() if i == j : if not s : return 1 else : if temp : i = temp.pop() else : i = s.popleft() continue else : temp.extend(i) i = j return 0 너무 복잡하게 생각한 문제... ※ 더 쉬운 풀이는 밑에 있어요 ! ※ 1) 홀수 거르기, 처음 from collections import deque def solution(s): if len(s) % 2 == 1 : r..

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 =..