第四周：[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:
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”].
All airports are represented by three capital letters (IATA code).
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.

---

给定起点，在有向图中寻找一条可以遍历所有顶点的路径，而且图中有可能有环。dfs非常适合这种图的遍历，实现过程中需要注意若节点有多路分岔的话，以字母序先后遍历分支路径，考虑到这个，决定用multiset存储子节点（自带排序功能）。整个有向图使用邻接表的形式储存。输出时需要注意将dfs的结果逆序，才是最终答案。

---

class Solution {
public:
    void dfs(map<string,multiset<string>>& m,string now,vector<string>& ans){
    string next;
    while(m[now].size()){
        next = *m[now].begin();
        m[now].erase(m[now].begin());
        dfs(m, next, ans);
    }
    ans.push_back(now);
}

vector<string> findItinerary(vector<pair<string, string>> tickets) {
    map<string,multiset<string>> m;
    vector<string> ans;
    int i;
    for(i = 0;i < tickets.size();i++)
        m[tickets[i].first].insert(tickets[i].second);
    dfs(m, "JFK", ans);
    vector<string> s;
    for(i = ans.size() - 1;i >= 0;i--)
        s.push_back(ans[i]);
    return s;
    }
};