# Middle-题目101：332. Reconstruct Itinerary

103人阅读 评论(0)

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) {
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的碎碎念：

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：64203次
• 积分：3285
• 等级：
• 排名：第10726名
• 原创：270篇
• 转载：53篇
• 译文：0篇
• 评论：8条
文章分类
阅读排行
最新评论