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:

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:
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.

摘自

https://discuss.leetcode.com/topic/36383/share-my-solution/2

http://baike.baidu.com/link?url=tAw2UE0m5LCUTc4-pdMXJFjxT1_Oxy3HzRZKJ4tK37CXJqctrBNpfNI26PY0KMXkn0-mSwHD5TdRKfk_HXGRmq

每个字串可以看做一个顶点，tickets就是边，要求实际上是求欧拉回路，附带的条件是边的字典序尽量小。

All the airports are vertices and tickets are directed edges. Then all these tickets form a directed graph.

The graph must be Eulerian since we know that a Eulerian path exists.

Thus, start from "JFK", we can apply the Hierholzer's algorithm to find a Eulerian path in the graph which is a valid reconstruction.

Since the problem asks for lexical order smallest solution, we can put the neighbors in a min-heap. In this way, we always visit the smallest possible neighbor first in our trip.

看一组数据，[["JFK","KUL"],["JFK","NRT"],["NRT","JFK"]]，如果简单地借助优先队列，很可能会搜索之后就找不到路径了，例如搜索到

["JFK","KUL"]以后就没有办法进行下去了，如果使用回溯朴素搜索，复杂度暴增，需要利用欧拉回路的性质。

-----------------------------------------------------------------------------------------------------------------------------------

求欧拉回路的思路：

循环的找到出发点。从某个节点开始，然后查出一个从这个出发回到这个点的环路径。这种方法不保证每个边都被遍历。如果有某个点的边没有被遍历就让这个点为起点，这条边为起始边，把它和当前的环衔接上。这样直至所有的边都被遍历。这样，整个图就被连接到一起了。

具体步骤：

1。如果此时与该点无相连的点，那么就加入路径中

2。如果该点有相连的点，那么就加入队列之中，遍历这些点，直到没有相连的点。

3。处理当前的点，删除走过的这条边，并在其相邻的点上进行同样的操作，并把删除的点加入到路径中去。

4。这个其实是个递归过程。

HashMap<String, PriorityQueue<String>> flights;
	LinkedList<String> path;

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

	public void dfs(String departure)
	{
		PriorityQueue<String> arrivals = flights.get(departure);
		while (arrivals != null && !arrivals.isEmpty())
			dfs(arrivals.poll());
		path.addFirst(departure);
	}