νŠœν”Œ

발자·2022λ…„ 9μ›” 19일
0

programmers

λͺ©λ‘ 보기
12/34
def solution(s):
    s = [i.split(',') for i in s[2:-2].split('},{')]
    s.sort(key=len)
    
    answer = []
    answer.append(int(s[0][0]))
    for i in range(1, len(s)) :
        k = [x for x in s[i] if x not in s[i-1]]
        answer.append(int(k[0]))
        
    return answer

πŸ—οΈ 리슀트 μ›μ†Œμ˜ 길이에 λ”°λΌμ„œ μ •λ ¬

🧩 counter + regular language둜 λ”μš± κ°„λ‹¨ν•˜κ²Œ 풀이할 수 μžˆλ‹€.

import re
from collections import Counter
s="{{1,2,3},{2,1},{1,2,4,3},{2}}"
print(Counter(re.findall('\d+', s)))
# 좜λ ₯
# Counter({'2': 4, '1': 3, '3': 2, '4': 1})

0개의 λŒ“κΈ€