drexqq

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