ํฌ๋ ์ธ ์ธํ๋ฝ๊ธฐ ๊ฒ์ ๋ฐ๋ก๊ฐ๊ธฐ
def solution(board, moves):
bucket = []
answer = 0
for index in [m-1 for m in moves] :
column = [x[index] for x in board]
for i, doll in enumerate(column) :
if doll == 0: continue
if bucket[-1:] == [doll]:
bucket.pop()
answer += 2
else:
bucket.append(doll)
board[i][index] = 0
break
return answer
from collections import Counter
def solution(participant, completion):
answer = Counter(participant) - Counter(completion)
return list(answer.keys())[0]
์ ๊ท ์์ด๋ ์ถ์ฒ ๋ฐ๋ก๊ฐ๊ธฐ
import re
def solution(new_id):
st = new_id
st = st.lower()
st = re.sub('[^a-z0-9\-_.]', '', st)
st = re.sub('\.+', '.', st)
st = re.sub('^[.]|[.]$', '', st)
st = 'a' if len(st) == 0 else st[:15]
st = re.sub('^[.]|[.]$', '', st)
st = st if len(st) > 2 else st + "".join([st[-1] for i in range(3-len(st))])
return st
def solution(seoul):
return '๊น์๋ฐฉ์ {}์ ์๋ค'.format(seoul.index('Kim'))
๋ฌธ์์ด ๋ด๋ฆผ์ฐจ์์ผ๋ก ๋ฐฐ์นํ๊ธฐ
def solution(s):
return ''.join(sorted(s, reverse = True))
๋ฌธ์์ด ๋ด ๋ง์๋๋ก ์ ๋ ฌํ๊ธฐ
def solution(strings, n):
return sorted(sorted(strings), key = lambda x : x[n])