(Python/LV2) 캐시

문제출처: https://school.programmers.co.kr/learn/courses/30/lessons/17680

프로그래머스

풀이:

잘 안 돼서 다른 분의 풀이를 활용했다,,

def solution(cacheSize, cities):
    cache = []
    res = 0
    for i in cities:
        i = i.lower()
        if cacheSize:
            if not i in cache:
                if len(cache) == cacheSize:
                    cache.pop(0)
                cache.append(i)
                res += 5
            else:
                cache.pop(cache.index(i))
                cache.append(i)
                res += 1
        else :
            res += 5
    return res

 

 

내장함수 이용한 풀이

def solution(cacheSize, cities):
    import collections
    cache = collections.deque(maxlen=cacheSize)
    time = 0
    for i in cities:
        s = i.lower()
        if s in cache:
            cache.remove(s)
            cache.append(s)
            time += 1
        else:
            cache.append(s)
            time += 5
    return time

# 놀랍다