Algorithm Problem/Python

[python] SWEA - 10912. ์™ธ๋กœ์šด ๋ฌธ์ž

deo2kim 2020. 11. 2. 08:15
๋ฐ˜์‘ํ˜•

๐Ÿค”๋ฌธ์ œ ํ•ด๊ฒฐ

  • lv3 | ๋ฌธ์ž์—ด

๐Ÿ’จ ๋ถ™์–ด์žˆ๋Š” ๋ฌธ์ž๋ผ๋ฆฌ ์‚ญ์ œํ•˜๋Š” ๊ฒƒ์ด ์•„๋‹ˆ๋ผ, ์–ด๋””์— ์žˆ๋˜ ๋‘ ๋ฌธ์ž๋ฅผ ์ฐ์ง€์œผ๋ฉด ๋œ๋‹ค.

๐Ÿ’ป์†Œ์Šค ์ฝ”๋“œ

for tc in range(int(input())):
    word = list(input())
    word.sort()
    stack = []

    for w in word:
        if stack and stack[-1] == w:
            stack.pop()
        else:
            stack.append(w)

    if stack:
        print(f'#{tc + 1} {"".join(stack)}')
    else:
        print(f'#{tc + 1} Good')
 

๐Ÿ“•๋ฌธ์ œ ํ™•์ธ

์ถœ์ฒ˜: SW Expert Academy

 

SW Expert Academy

SW ํ”„๋กœ๊ทธ๋ž˜๋ฐ ์—ญ๋Ÿ‰ ๊ฐ•ํ™”์— ๋„์›€์ด ๋˜๋Š” ๋‹ค์–‘ํ•œ ํ•™์Šต ์ปจํ…์ธ ๋ฅผ ํ™•์ธํ•˜์„ธ์š”!

swexpertacademy.com

 

๋ฐ˜์‘ํ˜•