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

思路：这个题是一个图的题目，首先建立图，利用hashmap和priorityqueue，因为题目要求字母最小序列，那么用pq，可以利用string自己本身的compareTo功能，进行排序. 然后 DFS去建立path，tricky的地方就是next需要加入list.add(0, next)加入前面；

错误点：

1. 这个题目是要求这个人的所有的票的行程，lexical order最小path，那么就要把所有的ticket全部串起来，所以dfs的循环是用while，把PQ里面的东西全部poll出来，用res连接起来。
2. Graph是用hashmap<String, PriorityQueue<String>>来表示。
3. 加入list，前面加完了，最后要加到最前面，所以用的是list.add(0, node)

class Solution {
    public List<String> findItinerary(List<List<String>> tickets) {
        List<String> list = new ArrayList<String>();
        HashMap<String, PriorityQueue<String>> graph = new HashMap<>();
        for(List<String> ticket: tickets) {
            String from = ticket.get(0);
            String to = ticket.get(1);
            graph.putIfAbsent(from, new PriorityQueue<String>());
            graph.get(from).add(to);
        }
        
        dfs(graph, "JFK", list);
        return list;
    }
    
    private void dfs(HashMap<String, PriorityQueue<String>> graph, String start, List<String> list) {
        PriorityQueue<String> pq = graph.get(start);
        while(pq != null && !pq.isEmpty()) {
            String node = pq.poll();
            dfs(graph, node, list);
        }
        list.add(0, start);
    }
}