카드 뭉치

#include <string>
#include <vector>
#include <queue>

using namespace std;

string solution(vector<string> cards1, vector<string> cards2, vector<string> goal) 
{
    string answer = "";
    bool result = false;
    queue <string> first_card;
    queue <string> second_card;
    int i, j = 0, k = 0;
    
    for(i = 0; i < cards1.size(); i++)
    {
        first_card.push(cards1[i]);
    }
    for(i = 0; i < cards2.size(); i++)
    {
        second_card.push(cards2[i]);
    }
    for(i = 0; i < goal.size(); i++)
    {
        if(goal[i] == first_card.front())
        {
            result = true;
            first_card.pop();
        }
        else if(goal[i] == second_card.front())
        {
            result = true;
            second_card.pop();
        }
        else
        {
            result = false;
            break;
        }
    }
    if(result == true)
    {
        answer = "Yes";
    }
    else
    {
        answer = "No";
    }
    
    return answer;
}