LeetCode每日一题(332. Reconstruct Itinerary)

You are given a list of airline tickets where tickets[i] = [fromi, toi] 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:

Input: tickets = [[“MUC”,“LHR”],[“JFK”,“MUC”],[“SFO”,“SJC”],[“LHR”,“SFO”]]
Output: [“JFK”,“MUC”,“LHR”,“SFO”,“SJC”]

Example 2:

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

---

我们根据 edges 可以得到每个 node 所需要到达的次数 stops， 然后从 JFK 出发，dfs 遍历整个 graph， 每走到一个 node, 我们将相应的 stops[node] -= 1, 在前往下一个 node 的时候我们将(source_node, destination_node)这个 edge 移出 edges。当 stops 中所有次数都为 0 时， 证明我们当前这条路径是可行的。

---

use std::collections::HashMap;

impl Solution {
   
    fn dp(mut paths: HashMap<String, Vec<String>>, curr: &str, remain: &mut HashMap<String, i32>) -> Option