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.

题目解读

给定一些飞机票，找出一个序列可以全部用完。要求如下

• 从JFK出发
• 如果有多个解，输出字典序最小的。

思路

用一个set来存放某个节点的可以到达的结点, set可以排序
用map来维护结点和它对应的邻接set

这个题目的特点: 一定存在这样的一条能用完所有边的路线. 并且要找出字典序最小的. 所以对每个节点而言, 从她的字典序最小的邻居开始DFS, 直到用完所有的边, 将该结点加到路径里.
由于路径是回溯的时候才得到的, 所以实际要返回的路径是相反的.

具体实现

class Solution {
public:

    vector<string> findItinerary(vector<pair<string, string>> tickets) {
        map<string, multiset<string>> adj;
        vector<string> route;

        for (auto t : tickets) {
            adj[t.first].insert(t.second);
        }

        dfs(adj, route, "JFK");

        return vector<string> (route.rbegin(), route.rend());
    }

    void dfs(map<string, multiset<string>>& adj, vector<string>& route, string b) {
        while (adj[b].size()) {
            auto next = adj[b].begin();
            adj[b].erase(next);
            dfs(adj, route, *next);
        }
        route.push_back(b);
    }
};