LeetCode #332 - Reconstruct Itinerary

题目描述：

Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, the itinerary must begin with JFK.

Note:

1. If there are multiple valid itineraries, you should return the itinerary that has the smallest lexical order when read as a single string. For example, the itinerary ["JFK", "LGA"] has a smaller lexical order than ["JFK", "LGB"].
2. All airports are represented by three capital letters (IATA code).
3. You may assume all tickets form at least one valid itinerary.

Example 1:

Input: tickets = [["MUC", "LHR"], ["JFK", "MUC"], ["SFO", "SJC"], ["LHR", "SFO"]]

Output: ["JFK", "MUC", "LHR", "SFO", "SJC"]

Example 2:

Input: tickets = [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO"]]

Output: ["JFK","ATL","JFK","SFO","ATL","SFO"]

Explanation: Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"]. But it is larger in lexical order.

根据多张机票，确定行程，当有多种可能性的时候，选取字典序较大的那一个。思路是利用递归，从起点出发，遍历所有的邻接点，每次遍历一个邻接点，就将这个邻接点删除，避免重复遍历。由于需要按照字典序遍历，所以要对邻接点排序，利用multiset存储就可以自动按字典序给邻接点排序。

class Solution {
public:
    vector<string> findItinerary(vector<pair<string, string>> tickets) {
        unordered_map<string,multiset<string>> graph;
        vector<string> result;
        for(int i=0;i<tickets.size();i++)
            graph[tickets[i].first].insert(tickets[i].second);
        DFS(graph,result,"JFK");
        reverse(result.begin(),result.end());
        return result;
    }
    
    void DFS(unordered_map<string,multiset<string>>& graph, vector<string>& result, string cur)
    {
        while(graph[cur].size()>0)
        {
            string next=*graph[cur].begin();
            graph[cur].erase(graph[cur].begin());
            DFS(graph,result,next);
        }
        result.push_back(cur);
    }
};