PROGRAMMERS 17677: [1차] 뉴스 클러스터링

Link : programmers.co.kr/learn/courses/30/lessons/17677

---

Python

def intersection(list1, list2):
    stack = []
    for i in list1:
        if i in list2:
            stack.append(i)
            list2.remove(i)
    return stack
 
 
def union(list1, list2):
    return list1 + list2
 
 
def solution(str1, str2):
    str1 = str1.lower()
    str2 = str2.lower()
    data1 = list()
    data2 = list()
    for i in range(0, len(str1) - 1):
        if 'a' <= str1[i] <= 'z' and 'a' <= str1[i + 1] <= 'z':
            data1.append(str1[i:i + 2])
    for i in range(0, len(str2) - 1):
        if 'a' <= str2[i] <= 'z' and 'a' <= str2[i + 1] <= 'z':
            data2.append(str2[i:i + 2])
 
    inter_data = intersection(data1, data2)
    total_data = union(data1, data2)
    if len(total_data) > 0:
        return int(len(inter_data) / len(total_data) * 65536)
    else:
        return 65536

FeedBack

1.  

---

 

 

 

cjw.git@gmail.com