카카오코테

import java.util.Stack; class Solution { public int solution(int[][] board, int[] moves) { int answer = 0; Stack stack = new Stack(); stack.push(0); for (int i = 0; i < moves.length; i++) { int select = moves[i] - 1; for (int j = 0; j < board.length; j++) { if (board[j][select] != 0) { if (stack.peek() == board[j][select]) { stack.pop(); answer += 2; } else{ stack.push(board[j][select]); } board..