알고리즘
1. 가장 가까운 같은 글자
풀이:
def solution(s):
answer = []
di = {}
for i in range(len(s)):
if s[i] not in di:
answer.append(-1)
else:
answer.append(i-di[s[i]])
di[s[i]] = i
return answer
풀이:
def solution(food):
answer = ''
for i in range(1, len(food)):
answer += str(i) * (food[i]//2)
return answer + '0' + answer[::-1]