Intentional practicing is of great importance.
332. Reconstruct Itinerary
URL: https://leetcode-cn.com/problems/reconstruct-itinerary/
Description: 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 withJFK.Constraints:
- 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.
Convert the graph to a tree and do post-order traversal.
