FilesExpand file tree

 master

/

5.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (23 loc) · 807 Bytes

 master

/

5.py

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (23 loc) · 807 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

import collections

import re

def solution(str1: str, str2: str) -> int:

# 두 글자씩 끊어서 다중집합 구성

str1s = [

str1[i:i + 2].lower()

for i in range(len(str1) - 1)

if re.findall('[a-z]{2}', str1[i:i + 2].lower())

]

str2s = [

str2[i:i + 2].lower()

for i in range(len(str2) - 1)

if re.findall('[a-z]{2}', str2[i:i + 2].lower())

]

# 교집합 계산

intersection = sum((collections.Counter(str1s) &

collections.Counter(str2s)).values())

# 합집합 계산

union = sum((collections.Counter(str1s) |

collections.Counter(str2s)).values())

# 자카드 유사도 계산

jaccard_sim = 1 if union == 0 else intersection / union

return int(jaccard_sim * 65536)