programmers | Lv2. ํŠœํ”Œ [Python]

yeonkยท2022๋…„ 3์›” 1์ผ
0

algorithm

๋ชฉ๋ก ๋ณด๊ธฐ
58/88
post-thumbnail

๐Ÿ’ก Python 3






๐Ÿ”— ๋ฌธ์ œ

ํŠœํ”Œ [Link]






๐Ÿ’ป ์ฝ”๋“œ

def solution(s):
    from collections import Counter
    result = ''
    for i in s:
        if i != '{' and i != '}': result += i
    counter = Counter(result.split(',')).most_common()
    return [int(n[0]) for n in counter]






๐Ÿ’ฅ ๋‹ค๋ฅธ ์‚ฌ๋žŒ ์ฝ”๋“œ

์ •๊ทœํ‘œํ˜„์‹ ๋„ˆ๋ฌด ์ถฉ๊ฒฉ์ ์ด๋‹ค..

import re
from collections import Counter

def solution(s):

    s = Counter(re.findall('\d+', s))
    return list(map(int, [k for k, v in sorted(s.items(), key=lambda x: x[1], reverse=True)]))






์ฐธ๊ณ  ์ž๋ฃŒ

[Python] re ๋ชจ๋“ˆ ์‚ฌ์šฉ๋ฒ•

0๊ฐœ์˜ ๋Œ“๊ธ€