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):..