๐Ÿงฉ Algorithm/SWEA

[SWEA] 1289. ์›์žฌ์˜ ๋ฉ”๋ชจ๋ฆฌ ๋ณต๊ตฌํ•˜๊ธฐ (Python/D3)

devCloud 2024. 10. 20. 21:20
728x90

[๋ฌธ์ œ ๋งํฌ] ๐Ÿ‘‡

 

SW Expert Academy

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

swexpertacademy.com


 

ํ’€์ด

์ž…๋ ฅ์ด 100์ด๋ผ๊ณ  ํ•  ๋•Œ,

  i = 1 i = 0 i = 0
ํ˜„์žฌ bit = 0 bit์™€ i๊ฐ€ ๋‹ค๋ฅด๋ฏ€๋กœ bit๋ฅผ 1๋กœ ๋ณ€๊ฒฝ
ํ˜„์žฌ bit = 1
bit์™€ i๊ฐ€ ๋‹ค๋ฅด๋ฏ€๋กœ bit๋ฅผ 0์œผ๋กœ ๋ณ€๊ฒฝ
ํ˜„์žฌ bit = 0
bit์™€ i๊ฐ€ ๊ฐ™์œผ๋ฏ€๋กœ ๊ทธ๋Œ€๋กœ
ํ˜„์žฌ bit = 0

 

 

Solution

test_case = int(input())
for tc in range(1, test_case + 1):
    memory = list(map(int, input()))
    result = 0
    bit = 0
    for i in memory:
        if bit != i:
            bit = i
            result += 1

    print("#%d %s" %(tc, result))

 

 

๐Ÿ‘ฉ‍๐Ÿ’ป ํšŒ๊ณ 

์ด ๋ฌธ์ œ๋Š” ํ’€์ด๋ฅผ ์•ˆ ๋ณด๊ณ ์„  ๋„์ €ํžˆ ํ’€ ๋ฐฉ๋ฒ•์ด ๋– ์˜ค๋ฅด์ง€ ์•Š์•˜๋‹ค. ๊ทธ๋Ÿฐ๋ฐ ํ’€์ด๊ฐ€ ๋„ˆ๋ฌด ๋‹จ์ˆœํ–ˆ๋‹ค.. ์กฐ๊ธˆ๋งŒ ๋” ์ƒ๊ฐํ–ˆ์–ด๋„ ๋˜‘๊ฐ™์ด ํ’€์—ˆ์„๊นŒ ์‹ถ๋‹ค. ์•„๋งˆ ๋” ๋ณต์žกํ•˜๊ฒŒ ํ’€์—ˆ์„ ๊ฒƒ ๊ฐ™๋‹ค.

 


 

728x90