๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Algorithm/SWEA

[swea] 1289 ์›์žฌ์˜ ๋ฉ”๋ชจ๋ฆฌ ๋ณต๊ตฌํ•˜๊ธฐ(ํŒŒ์ด์ฌ/python) - ๋น ๋ฅธ ์ฝ”๋“œ

by chjcoder 2023. 11. 11.

๐ŸŽˆ๋ฌธ์ œ

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV19AcoKI9sCFAZN&categoryId=AV19AcoKI9sCFAZN&categoryType=CODE&problemTitle=&orderBy=INQUERY_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

๐ŸŽ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๋ฐ ์ ‘๊ทผ

๋‹จ์ˆœ ๊ตฌํ˜„

1. ์›์žฌ์˜ ๋ฉ”๋ชจ๋ฆฌ๊ฐ€ 0000 -> 1111๋กœ ๋ฐ”๋€๋‹ค๊ณ  ์šฐ๋ฆฌ๋„ ๊ฐ™์ด ๋ฆฌ์ŠคํŠธ๋ฅผ ํ•˜๋‚˜ ๋งŒ๋“ค์–ด์„œ ๊ฐ’์„ ๋ฐ”๊ฟ”์ฃผ๊ณ  ์žˆ์œผ๋ฉด ๊ต‰์žฅํžˆ ๋А๋ฆฐ ์ฝ”๋“œ๊ฐ€ ํƒ„์ƒํ•œ๋‹ค.

2. ์šฐ๋ฆฌ๋Š” 0 -> 1 ๋กœ ์ง์ ‘ ๋ฐ”๊พธ๋Š” ๋Œ€์‹  flag๋ฅผ ์„ธ์›Œ์„œ ์ธ์‹๋งŒ ๋‹ค๋ฅด๊ฒŒ ํ•˜์ž.

 

๐Ÿ’ป์ฝ”๋“œ

# swea 1289. ์›์žฌ์˜ ๋ฉ”๋ชจ๋ฆฌ ๋ณต๊ตฌํ•˜๊ธฐ

T = int(input())
for test_case in range(1,T+1):
    lst = list(map(int,list(input())))
    len_lst = len(lst)
    cnt = 0

    flag = True
    for i in range(len_lst):
        if flag:
            if lst[i] == 0:
                continue
            else:
                flag = False
                cnt += 1
        else:
            if lst[i] != 0:
                continue
            else:
                flag = True
                cnt += 1
    print(f"#{test_case} {cnt}")

๐ŸŽ„์ฝ”๋“œ ์„ค๋ช…

์œ„์˜ ์„ค๋ช…์œผ๋กœ ๋Œ€์ฒดํ•œ๋‹ค.