KAKAO 기출문제 LV1. 크레인 인형뽑기 게임

2019 카카오 개발자 겨울인턴십

def solution(board, moves):
    answer = 0
    n= len(board)
    transs = [[0 for _ in range(n)] for _ in range(n)]
    for i in range(n):
        for j in range(n):
            transs[j][i] = board[i][j]
    trans = []
    for t in transs:
        t.reverse()
        trans.append(t)
    for t in trans:
        while True:
            if t[-1] != 0: break
            else : t.pop()

    stack = []
    cnt = 0
    for m in moves:
        if trans[m-1]:
            stack.append(trans[m-1].pop())
            if len(stack)>=2 and stack[-1] == stack[-2]:
                del stack[-1]
                del stack[-1]
                cnt += 2
    answer = cnt
    return answer

neo = [[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]]
apeach = [1,5,3,5,1,2,1,4]
frodo = solution(neo, apeach)
print(frodo)