Merge pull request #30 from kjs254/8-kjs254

8-kjs254
AlgoLeadMe · Mar 18, 2024 · 22050f6 · 22050f6
2 parents cfeb1c3 + 64756c3
commit 22050f6
Show file tree

Hide file tree

Showing 2 changed files with 19 additions and 2 deletions.
diff --git a/kjs254/README.md b/kjs254/README.md
@@ -9,5 +9,4 @@
 | 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) |
-=======
----
+| 8차시 | 2024.03.08 | 구현 | [튜플](https://school.programmers.co.kr/learn/courses/30/lessons/64065) | [#30](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/30) |
diff --git a/kjs254/구현/튜플.py b/kjs254/구현/튜플.py
@@ -0,0 +1,18 @@
+def solution(s):
+    answer = []
+    dic = {}
+    s = s.replace('{','').replace('}','').split(',')
+
+    for n in s:
+        n = int(n)
+        if n not in dic:
+            dic[n] = 1
+        else:
+            dic[n]+= 1
+
+    dic_sorted = sorted(dic.items(), key=lambda x:x[1], reverse=True)
+
+    for d in dic_sorted:
+        answer.append(d[0])
+
+    return answer