๐๏ธ Algorithm/โฌ ํ๋ก๊ทธ๋๋จธ์ค
[Programmers] [2019 ์นด์นด์ค ๊ฐ๋ฐ์ ๊ฒจ์ธ ์ธํด์ญ] [Python] Level1_ํฌ๋ ์ธ ์ธํ๋ฝ๊ธฐ ๊ฒ์
Dbswnstjd
2022. 3. 11. 23:36
https://programmers.co.kr/learn/courses/30/lessons/64061?language=python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ํฌ๋ ์ธ ์ธํ๋ฝ๊ธฐ ๊ฒ์
[[0,0,0,0,0],[0,0,1,0,3],[0,2,5,0,1],[4,2,4,4,2],[3,5,1,3,1]] [1,5,3,5,1,2,1,4] 4
programmers.co.kr
ํ์ด
# ํ๋ก๊ทธ๋๋จธ์ค 1๋จ๊ณ - ํฌ๋ ์ธ ์ธํ๋ฝ๊ธฐ ๊ฒ์
def solution(board, moves):
stack_list = []
answer = 0
for move in moves:
for i in range(len(board)):
if board[i][move-1] != 0:
stack_list.append(board[i][move-1])
board[i][move-1] = 0
if len(stack_list) > 1:
if stack_list[-1] == stack_list[-2]:
stack_list.pop(-1)
stack_list.pop(-1)
answer += 2
break
return answer
์ฒ์์ board์ ๋ํด ์ดํด๊ฐ ์๋ผ์ ๊ทธ๋ ค๋ณด๋ฉด์ ์๊ฐ์ ํด๋ณด๋ ์๊ฐ๋ณด๋ค ๋จ์ํ stack์ ์ด์ฉํ ๋ฌธ์ ์๋ค.