[SWEA] - 10912. 외로운문자

내코드

for tc in range(1, int(input())+1):
    char = list(input())
    N = len(char)
    a_char = [0] * N

    i = 0
    while i < N:
        a_char[i] = ord(char[i])
        i += 1
    # 중복값 제거해서 리스트에 담아주기
    set_char = list(set(a_char))
    count = [0] * (len(set_char))

    for i in range(len(set_char)) :
        cnt = 0
        for j in range(len(a_char)) :
            if set_char[i] == a_char[j] :
                cnt +=1
        count[i] = cnt
    ans = []
    for h in range(len(count)) :
        if count[h]%2:
            ans.append(set_char[h])
    ans.sort()

    result = ''
    if len(ans) == 0 :
        result = 'Good'
    else:
        for c in ans:
            result += chr(c)

    print('#{} {}'.format(tc, result))

같은반친구코드

t = int(input())
answer = []
for tc in range(1, t + 1):
    word = input()
    check = [False for _ in range(26)]

    for c in word:
        next = ord(c) - 97
        if check[next]:
            check[next] = False
        else:
            check[next] = True
    ans = ""
    isClear = True
    for i in range(26):
        if check[i]:
            isClear = False
            ans += chr(97 + i)
    if isClear:
        ans = "Good"
    answer.append(f"#{tc} {ans}")
print("\n".join(answer))