332. Reconstruct Itinerary

Posted on Edited on In

332. Reconstruct Itinerary

Description

You are given a list of airline tickets where tickets[i] = [from<sub>i</sub>, to<sub>i</sub>] represent the departure and the arrival airports of one flight. Reconstruct the itinerary in order and return it.

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"].

You may assume all tickets form at least one valid itinerary. You must use all the tickets once and only once.

Example 1:

1
2
Input: tickets = [["MUC","LHR"],["JFK","MUC"],["SFO","SJC"],["LHR","SFO"]]
Output: ["JFK","MUC","LHR","SFO","SJC"]

Example 2:

1
2
3
Input: tickets = [["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.

Constraints:

  • 1 <= tickets.length <= 300
  • tickets[i].length == 2
  • fromi.length == 3
  • toi.length == 3
  • fromi and toi consist of uppercase English letters.
  • fromi != toi

Hints/Notes

  • 2025/01/06
  • backtracking
  • No solution from 0x3F

Solution

Language: C++

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
class Solution {
public:
    vector<string> path;
    map<string, multiset<string>> m;
    int curTicket = 0, totalTicket = 0;

    vector<string> findItinerary(vector<vector<string>>& tickets) {
        for (auto& t : tickets) {
            string from = t[0], to = t[1];
            m[from].insert(to);
        }
        dfs("JFK");
        reverse(path.begin(), path.end());
        return path;
    }

    void dfs(string root) {
        while (m[root].size()) {
            string next = *m[root].begin();
            m[root].erase(m[root].begin());
            dfs(next);
        }
        path.push_back(root);
    }
};