[Python] 프로그래머스 캐시

코딩테스트 연습 - [1차] 캐시

---

풀이

collections의 deque를 사용하여 해결했습니다.

---

코드

from collections import deque


def solution(cacheSize, cities):
    answer = 0

    cache = deque()

    if cacheSize == 0:
        return len(cities) * 5

    cur = 0
    for city in cities:
        city = city.upper()

        if city in cache:
            answer += 1
            cache.remove(city)
            cache.appendleft(city)
        else:
            answer += 5

            if cur < cacheSize:
                cache.appendleft(city)
                cur += 1
            else:
                cache.pop()
                cache.appendleft(city)

    return answer

---

pyo7410/Algorithm