leetcode练习 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.

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

最近一直在写图，主要是想找到一个比较好的生成图的方式。这次发现了unordered_map，就用了一下，感觉很方便。

class Solution {
public:
    vector<string> findItinerary(vector<pair<string, string>> tickets) {
        unordered_map<string, multiset<string>> graph;
        for (auto x: tickets) {
            graph[x.first].insert(x.second);
        }
        stack<string> s;
        s.push("JFK");
        vector<string> result;
        while(!s.empty()) {
            string cur = s.top();
            if (graph[cur].size() != 0 && graph.find(cur) != graph.end()) {
                s.push(*graph[cur].begin());
                graph[cur].erase(graph[cur].begin());
            } else {
                result.insert(result.begin(), cur);
                s.pop();
            }
        }
        return result;
    }
};

题目主要还是深度优先搜索。关于存图的方式，得再多做几种题习惯习惯