์ฝ”ํ…Œ์ค€๋น„

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค. ํ–„๋ฒ„๊ฑฐ ๋งŒ๋“ค๊ธฐ

์š”๋Œœ๋‹ค 2023. 1. 23. 02:10

https://school.programmers.co.kr/learn/courses/30/lessons/133502#

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

def solution(ingredient):
    answer = 0
    stack = []
    for i in ingredient:
            stack.append(i)
            if len(stack) >= 4:
                if stack[-4] == 1 and stack[-3] == 2 and stack[-2] == 3 and stack[-1] == 1:
                    stack.pop()
                    stack.pop()
                    stack.pop()
                    stack.pop()
                    answer += 1
            
    return answer
"""
1 2 3 1์ด๋ฉด ans += 1
"""

๋ง ๊ทธ๋ž˜๋„ 1-2-3-1์ด๋ฉด ๋ชจ๋‘ pop()์„ ํ†ตํ•ด ์—†์• ์ฃผ๊ณ  ์นด์šดํŠธ 1์„ ๋Š˜๋ ค์ฃผ๋ฉด ๋œ๋‹ค.