Formatted question description:

 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.


     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:

 Input: [["MUC", "LHR"], ["JFK", "MUC"], ["SFO", "SJC"], ["LHR", "SFO"]]
 Output: ["JFK", "MUC", "LHR", "SFO", "SJC"]

 Example 2:

 Input: [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO"]]
 Output: ["JFK","ATL","JFK","SFO","ATL","SFO"]

 Explanation: Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"].
                But it is larger in lexical order.



First of all, the graph is established, through the adjacency linked list.

Since the problem requires the solution to be small in alphabetical order, then we consider using multiset, which can be automatically sorted.

After our graph is built, we start traversal from node JFK. As long as there is a node in the multiset mapped by the current node, we take this node out, delete it in the multiset, and then continue to recursively traverse this node.

Finally, the order of our results is the opposite of what we need, we will flip it again at the end。



import java.util.*;

public class Reconstruct_Itinerary {

    public static void main(String[] args) {
        Reconstruct_Itinerary out = new Reconstruct_Itinerary();
        Solution s = Solution();


    public class Solution {
        public List<String> findItinerary(List<List<String>> tickets) {

            List<String> result = new ArrayList<>();

            if (tickets == null || tickets.size() == 0) {
                return result;

            // step 1: build the ajdList
            // start => list of destinations
            Map<String, List<String>> adjList = new HashMap<>();
            for (List<String> ticket : tickets) {
                String from = ticket.get(0);
                String to = ticket.get(1);

                if (adjList.containsKey(from)) {
                } else {
                    List<String> neighbors = new ArrayList<>();
                    adjList.put(from, neighbors);

            // step 2: sort the adjlist according to lex order
            for (String from : adjList.keySet()) {
                List<String> neighbors = adjList.get(from);

            // step 3: start the dfs
            findItineraryDfs("JFK", adjList, result);

            return result;

        private void findItineraryDfs(String curr, Map<String, List<String>> adjList, List<String> result) {

            List<String> neighbors = adjList.get(curr);

            if (neighbors != null) {
                while (neighbors.size() > 0) {
                    String neighbor = neighbors.get(0); // get first one, lex order
                    neighbors.remove(0); // @note: here is the duplicate removal part, next recursion will not have this neighbour

                    findItineraryDfs(neighbor, adjList, result);

            result.add(0, curr);
// Java Lambda
public List<String> findItinerary(String[][] tickets) {
    Map<String, PriorityQueue<String>> targets = new HashMap<>();
    for (String[] ticket : tickets)
        targets.computeIfAbsent(ticket[0], k -> new PriorityQueue()).add(ticket[1]);
    return route;

Map<String, PriorityQueue<String>> targets = new HashMap<>();
List<String> route = new LinkedList();

void visit(String airport) {
    while(targets.containsKey(airport) && !targets.get(airport).isEmpty())
    route.add(0, airport);

All Problems

All Solutions