[SWEA] 4872.반복문자 지우기

def stack_pop(words):
    for i in range(len(words)-1):
        if words[i] == words[i+1]:
            j = i

            for j in range(j,j+2): #연속된 두개 삭제
                words.pop(i)
            return stack_pop(words) #재귀
    return len(words)



T = int(input())

for tc in range(1, T+1):
    words = list(input()) 

    stack_pop(words)



    print("#{} {}".format(tc,stack_pop(words)))