2024-03-01 캐시

AlgoLeadMe · Mar 1, 2024 · 3267c9c · 3267c9c
1 parent 25ce19e
commit 3267c9c
Show file tree

Hide file tree

Showing 2 changed files with 31 additions and 4 deletions.
diff --git a/kjs254/README.md b/kjs254/README.md
@@ -4,7 +4,9 @@
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.02.12 |  스택  | [기능개발](https://school.programmers.co.kr/learn/courses/30/lessons/42586)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/2) |
 | 2차시 | 2024.02.15 | 큐 | [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587) | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/6) |
-| 3차시 | 2024.02.15 | 힙 | [야근지수](https://school.programmers.co.kr/learn/courses/30/lessons/12927) | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/10) |
-| 4차시 | 2024.02.15 | 힙 | [구명보트](https://school.programmers.co.kr/learn/courses/30/lessons/42885) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/14) |
-| 5차시 | 2024.02.15 | 힙 | [모음사전](https://school.programmers.co.kr/learn/courses/30/lessons/84512) | [#19](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/19) |
----
+| 3차시 | 2024.02.18 | 힙 | [야근지수](https://school.programmers.co.kr/learn/courses/30/lessons/12927) | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/10) |
+| 4차시 | 2024.02.21 | 큐 | [구명보트](https://school.programmers.co.kr/learn/courses/30/lessons/42885) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/14) |
+| 5차시 | 2024.02.24 | DFS | [모음사전](https://school.programmers.co.kr/learn/courses/30/lessons/84512) | [#19](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/19) |
+| 6차시 | 2024.02.27 | 스택 | [괄호 회전하기](https://school.programmers.co.kr/learn/courses/30/lessons/76502) | [#22](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/22) |
+| 7차시 | 2024.03.01 | 구현 | [캐시](https://school.programmers.co.kr/learn/courses/30/lessons/17680) | [#24](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/24) |
+---
diff --git a/kjs254/구현/캐시.py b/kjs254/구현/캐시.py
@@ -0,0 +1,25 @@
+def solution(cacheSize, cities):
+    answer = 0
+    cities = [city.lower() for city in cities]
+    cache, cache_hit = [], []
+
+    for i,city in enumerate(cities):
+        if len(cache)<cacheSize and city not in cache:
+            cache.append(city)
+            cache_hit.append(i)
+            answer +=5
+
+        elif city in cache:
+            cache_hit[cache.index(city)] =i
+            answer +=1
+
+        elif cache:
+            idx = cache_hit.index(min(cache_hit))
+            cache[idx] = city
+            cache_hit[idx] = i
+            answer +=5
+
+        else:
+            answer+=5
+
+    return answer