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: [["MUC", "LHR"], ["JFK", "MUC"], ["SFO", "SJC"], ["LHR", "SFO"]]
Output: ["JFK", "MUC", "LHR", "SFO", "SJC"]

Example 2:

Input: [["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.

/* 每张机票是一条边 利用dfs遍历完所有的点时构成 一条通路
 * 数据结构 由于边是字符串而非0 1 2这种数字
 * 采用map<string, multiset<string>> 作为邻接表 由于是multiset 是自动排序
 * 采用欧拉通路求法  即：
 *      每条边只遍历一次 递归时 删除该边 对到达点递归 回溯时记录点
 * */
class Solution {
public:
    vector<string> findItinerary(vector<vector<string>>& tickets) {
        map<string, multiset<string>> m;
        for(auto &p_s:tickets){
            m[p_s[0]].insert(p_s[1]);
        }
        vector<string> ret;
        dfs(m, ret, "JFK");
        reverse(ret.begin(), ret.end());
        return ret;
    }
    void dfs(map<string, multiset<string>> &m, vector<string> &ret, string cur){
        while(m[cur].size()){
            string tmp = *(m[cur].begin());
            m[cur].erase(m[cur].begin());// 按key删除时会删除所有相同的元素 所以找到一个等于值的it位置删除更好
            dfs(m, ret, tmp);
        }
        ret.push_back(cur);
    }
};