프로그래머스 여행경로 C++

dfs로 탐색해서 풀면 되는 문제이다. 내가 작성한 코드는 아래와 같다.

 

#include <string>
#include <algorithm>
#include <vector>
#include <iostream>

using namespace std;

vector<vector<string>> Tickets;
vector<string> Answer;

int visited[10001];
int should_end;

void dfs(string s, int count){
    if (count == Tickets.size()){
        should_end = 1;
    }
    else{
        for (int i=0;i<Tickets.size();i++){
            if (visited[i]==1){
                continue;
            }
            if (Tickets[i][0]!=s){
                continue;
            }
            Answer.push_back(Tickets[i][1]);
            visited[i]=1;
            dfs(Tickets[i][1], count+1);
            if (should_end==0){
                visited[i]=0;
                Answer.pop_back();
            }
        }
    }
}

vector<string> solution(vector<vector<string>> tickets) {
    vector<string> answer;
    Tickets = tickets;
    sort(Tickets.begin(), Tickets.end());
    Answer.push_back("ICN");
    dfs("ICN", 0);
    for (int i=0;i<Answer.size();i++){
        cout<<Answer[i]<<" ";
    }
    answer=Answer;
    return answer;
}