프로그래머스 : 카카오_크레인 인형 뽑기 게임(C++)_Stack

풀이

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>
#include <stack>

using namespace std;

int solution(vector<vector<int>> board, vector<int> moves) {
    int answer = 0;
    stack<int> stack;
    for (int move : moves) {
        for (int i = 0; i < board[move - 1].size(); i++) {
            if (board[i][move - 1] != 0) {
                if (stack.empty()) {
                    stack.push(board[i][move - 1]);
                }
                else {
                    if (stack.top() == board[i][move - 1]) {
                        stack.pop();
                        answer+=2;
                    }
                    else {
                        stack.push(board[i][move - 1]);
                    }
                }

                board[i][move - 1] = 0;
                break;
            }
        }
    }
    return answer;
}