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:
You are given a list of airline tickets where tickets[i] = [from_i, to_i] 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.
["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.
The itinerary ["JFK","ATL","JFK","SFO","ATL","SFO"] has a smaller lexical order than ["JFK","SFO","ATL","JFK","ATL","SFO"].
1 <= tickets.length <= 300tickets[i].length == 2from_i.length == 3to_i.length == 3from_i and to_i consist of uppercase English letters.from_i != to_iFollow-up: What if you need to return all valid itineraries instead of just the lexicographically smallest one?