56-xxubin04

xxubin04/README.md

@@ -51,3 +51,10 @@
 | 47차시 | 2024.05.23 |  Math  | <a href="https://www.acmicpc.net/problem/14241">[14241]슬라임 합치기</a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/178 |
 | 48차시 | 2024.05.27 |  구현  | <a href="https://leetcode.com/problems/valid-palindrome">[125]Valid Palindrome</a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/182 |
 | 49차시 | 2024.05.30 |  Hash  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/92341?language=python3">[2022_KAKAO]주차 요금 계산</a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/184 |
+| 50차시 | 2024.06.04 |  구현  | <a href="https://leetcode.com/problems/longest-common-prefix/description/">[14]Longest Common Prefix</a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/191 |
+| 51차시 | 2024.07.01 |  Math  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/140107">[Programmers]점 찍기 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/194 |
+| 52차시 | 2024.07.05 |  구현  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/64065">[2019 카카오 인턴십]튜플 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/198 |
+| 53차시 | 2024.07.08 |  DP  | <a href="https://www.acmicpc.net/problem/2193">[2193]이친수 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/200 |
+| 54차시 | 2024.07.11 |  Tree  | <a href="https://www.acmicpc.net/problem/1991">[1991]트리 순회 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/203 |
+| 55차시 | 2024.07.29 |  정렬  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/42747?language=python3">[Programmers]H-Index </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/208 |
+| 56차시 | 2024.08.05 |  구현  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/17677#">[2018 KAKAO BLIND]뉴스 클러스터링 </a>  | https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/211 |

xxubin04/구현/뉴스 클러스터링.py

@@ -0,0 +1,26 @@
+from math import floor
+
+def solution(str1, str2):
+    answer = 0
+    list1, list2 = [], []
+    for a in range(len(str1)-1):
+        if (slice_a := str1[a:a+2]).isalpha():
+            list1.append(str1[a:a+2].upper())
+    for b in range(len(str2)-1):
+        if (slice_b := str2[b:b+2]).isalpha():
+            list2.append(str2[b:b+2].upper())
+
+    total = len(list1) + len(list2)
+    duplication = 0
+
+    for i in list1:
+        if i in list2:
+            list2.remove(i)
+            duplication += 1
+
+    if len(list2) == 0 or total == duplication:
+        return 65536
+
+    answer = floor(duplication / (total - duplication) * 65536)
+
+    return answer