[1차] 캐시

Python

def solution(cacheSize, cities):
    answer = 0
    lru = [0] * cacheSize
    if cacheSize == 0:
        return len(cities) * 5
    
    for city in cities:
        city = city.lower()
        if city not in lru:
            lru = lru[1:] + [city]
            answer += 5
        else:
            lru.remove(city)
            lru.append(city)
            answer += 1
    
    return answer