332. Reconstruct Itinerary（C++实现）

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:
tickets = [["MUC", "LHR"], ["JFK", "MUC"], ["SFO", "SJC"], ["LHR", "SFO"]]
Return ["JFK", "MUC", "LHR", "SFO", "SJC"].

Example 2:
tickets = [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO"]]
Return ["JFK","ATL","JFK","SFO","ATL","SFO"].
Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"]. But it is larger in lexical order.

算法思想：

将所有的机票用map保存，map<string,multimap<string>>，将val用multimap<string>保存，可以保存当前出发地能到达的所有的目的地。并且由于multimap会自动排序，最后得到的结果必定满足字典序最小．

利用DFS思想，用栈做中介，首先将"JFK"入栈，搜索map，将当前搜索的string入栈，直到map为空。开始从stack中取出string，加到结果res中。

<span style="font-size:18px;">class Solution {
public:
    vector<string> findItinerary(vector<pair<string, string>> t) {
        vector<string> res;
        if(t.size()==0)return res;
        map<string,multiset<string>> map;
        for(auto val:t)//C++II新语法
            map[val.first].insert(val.second);
        stack<string> st;
        st.push("JFK");
        while(!st.empty())
        {
            string s=st.top();
            if(map.find(s)!=map.end()&&map[s].size()>0)
            {
                st.push(*map[s].begin());
                map[s].erase(map[s].begin());
            }
            else {
                res.insert(res.begin(),s);
                st.pop();
            }
        }
        return res;
    }
};</span>