🐜 Study: [1차] 뉴스 클러스터링 (#95)

Author: ing-eoking

ing-eoking/[1차] 뉴스 클러스터링.py

@@ -0,0 +1,10 @@
+from collections import Counter
+
+def solution(str1, str2):
+    ext = lambda s: [s[i:i+2] for i in range(len(s)-1)
+                         if (s[i:i+2]).isalpha()]
+    a = Counter(ext(str1.lower()))
+    b = Counter(ext(str2.lower()))
+    itr = sum((a & b).values())
+    uni = sum((a | b).values())
+    return 65536 if uni == 0 else int(itr / uni * 65536)