[프로그래머스] [Level 2] [2018 KAKAO BLIND RECRUITMENT] [캐시] 1차 캐시

1차 캐시

프로그래머스

 

• 내 풀이
  • cacheSize==0 일 때 고려해야 함

from collections import deque
def solution(cacheSize, cities):
    queue=deque()
    answer=0
    if cacheSize==0:
        return len(cities)*5
    
    for city in cities:
        city=city.upper()
        
        if city in queue:
            answer+=1 #캐시히트
            queue.remove(city)
            queue.append(city)
        else:
            if len(queue)>=cacheSize and queue:
                queue.popleft()
            answer+=5 #캐시미스
            queue.append(city)
    
    return answer