[Programmers] 크레인 인형 뽑기

알고리즘 문제풀이

문제 링크

def solution(board, moves):
    prev_doll = []
    cnt = 0
    for move in moves:
        for idx, data in enumerate(board):
            doll = board[idx][move - 1]
            if doll != 0:
                prev_doll.append(doll)
                if len(prev_doll) > 1:
                    if prev_doll[-2] == prev_doll[-1]:
                        cnt += 2
                        prev_doll.pop()
                        prev_doll.pop()
                board[idx][move - 1] = 0
                break
                                
#     board_sort = []
#     for idx, x in enumerate(board):
#         tmp = []
#         for y in x:
#             if y != 0:
#                 tmp.append(y)
#         board_sort.append(tmp)
    
#     prev = 0
#     cnt = 0
#     for move in moves:
#         if board_sort[move - 1]:
#             num = board_sort[move - 1].pop()
#             if prev == num:
#                 cnt += 2
#                 prev = 0
#             else:
#                 prev = num
    
    return cnt