프로그래머스-크레인 인형 뽑기

import java.util.Stack;

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