인프런 커뮤니티 질문&답변

package hello;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.Stack;

public class Main {
	
	
	public int solution(int n, int[][] board, int m, int[] moves) {
		Stack<Integer> baguny = new Stack<>();
		int count = 0;
		
		//크레인
		for(int i=0; i<moves.length; i++) {
			//크레인 작동위치에서 인형빼와서 바구니에 담기
			for(int j=0; j<board.length; j++) {
				if(board[j][moves[i]-1] != 0) {
					if(baguny.contains(board[j][moves[i]-1])) {
						baguny.pop();
						count += 2;
						board[j][moves[i]-1] = 0;
						break;
					} else {
						baguny.push(board[j][moves[i]-1]);
						board[j][moves[i]-1] = 0;
						break;
					}
					
				}
			}
			
			
			
		}
		
		return count;
	}

	public static void main(String[] args) {
		Main t = new Main();
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		
		int[][] board = new int[n][n];
		for(int i=0; i<n; i++) {
			for(int j=0; j<n; j++) {
				board[i][j] = sc.nextInt();
			}
		}
		
		int m = sc.nextInt();
		
		int[] moves = new int[m];
		for(int i=0; i<m; i++) {
			moves[i] = sc.nextInt();
		}
		
		System.out.println(t.solution(n, board, m, moves));
	}
}