[38일차][프로그래머스][142086]가장 가까운 같은 글자

def solution(s):
    result = []
    count = 0
    for idx1 in range(len(s)): 
        for idx2 in range(idx1-1, -1, -1):
            if s[idx1] == s[idx2]:
                count = idx1 - idx2
                break
            else:
                count = 0
                
        if count == 0:            
            result.append(-1)
        else:
            result.append(count)
        
    return result