튜플안의 숫자의 나열을 참고하여, 원래 숫자 배열을 산출
https://programmers.co.kr/learn/courses/30/lessons/64065
def solution(s):
s = s.replace("{","[")
s = s.replace("}","]")
answer = []
pre_set = set([])
for e_s in sorted(eval(s),key= lambda x : len(x)):
answer.append(list(set(e_s) - pre_set)[0])
pre_set = set(e_s)
return answer
Tips.
1. 정규 표현식 사용 (참고: https://velog.io/@geonhwi/%EC%A0%95%EA%B7%9C%ED%91%9C%ED%98%84%EC%8B%9D-2)
2. import re
3. from collection import Counter
import re
from collections import Counter
def solution(s):
numbers = Counter(re.findall(r'\d+',s))
ans = sorted(numbers,key = lambda x : numbers[x], reverse = True)
return list(map(int,ans))