# Middle-题目101：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.

public class Solution {
Map<String, PriorityQueue<String>> mp;

public List<String> findItinerary(String[][] tickets) {
res = new LinkedList<String>();
mp = new HashMap<String, PriorityQueue<String>>();
for (String[] ticket : tickets) {
if (!mp.containsKey(ticket[0])) {
mp.put(ticket[0], new PriorityQueue<String>());
}
mp.get(ticket[0]).offer(ticket[1]);
}
dfs("JFK");
return res;
}

public void dfs(String cur) {
while (mp.containsKey(cur) && !mp.get(cur).isEmpty()) {
dfs(mp.get(cur).poll());
}
}
}

12ms,beats 81.78%,众数14ms,12.37%
Cmershen的碎碎念：

• 本文已收录于以下专栏：

举报原因： 您举报文章：Middle-题目101：332. Reconstruct Itinerary 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)