Leetcode 刷题 - 332 - Reconstruct Itinerary

关注

原创最新推荐文章于 2025-12-27 08:33:21 发布 900 阅读 AI 写同款· GEO 优化 ›

Python interview - override & overload 我们先说overload 重载。在Java中，支持重载，重载的意思是能够定义有相同方法名的方法，传入方法中的参数个数，或者参数类型不同。比如： int mymethod(int a, int b) int mymethod(int num) float mymethod(int a, float b) float mymethod(float var1, int var2) in 阅读详情

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.

Note:

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:
tickets = [["MUC", "LHR"], ["JFK", "MUC"], ["SFO", "SJC"], ["LHR", "SFO"]]
Return ["JFK", "MUC", "LHR", "SFO", "SJC"].

Example 2:
tickets = [["JFK","SFO"],["JFK","ATL"],["SFO","ATL"],["ATL","JFK"],["ATL","SFO"]]
Return ["JFK","ATL","JFK","SFO","ATL","SFO"].
Another possible reconstruction is ["JFK","SFO","ATL","JFK","ATL","SFO"]. But it is larger in lexical order.

根据题意，input是一系列换乘的机票，肯定有一种方式可以连接起来。要求从JFK出发，把所有的机场按照顺序排序，同时，如果有选择，机场的顺序需要按照字母顺序排列。

1. 采用字典，departure - [ arrival ]

2. dfs 深度搜索，递归调用

3. trace back 回溯，增加判断如果不可能的就恢复数据，然后返回继续dfs搜索

class Solution(object):
    def findItinerary(self, tickets):
        result = ["JFK"]

        dic = collections.defaultdict(list) # defaultdict never raise KeyError
        for flight in tickets:
            dic[flight[0]] += flight[1],

        self.dfs_helper(dic, "JFK", result, len(tickets))

        return result

    def dfs_helper(self, dic, departure, result, flights):
        if len(result) == flights + 1: # dfs出口，条件成立表示找到了最终的结果
            return result

        currentDst = sorted(dic[departure]) 
        for dst in currentDst: # loop所有的目的地
            dic[departure].remove(dst)
            result.append(dst)

            valid = self.dfs_helper(dic, dst, result, flights) # 深度搜索，对每个目的地进行loop
            if valid: # 递归得到dfs的值。如果当前dst没有目的地，会返回None
                return valid

            result.pop() # 回复步骤。如果返回的是None，就把result和字典复原，数据复原后继续下一个搜索
            dic[departure].append(dst)

=======

collections.defaultdict()

defaultdict（）永远不会出现KeyError的错误。

from collections import defaultdict

def default_function():
    return 'default value'

ice_cream = defaultdict(default_function, Hello='World')
ice_cream['Sarah'] = 'Chunky Monkey'
ice_cream['Abdul'] = 'Butter Pecan'
print ice_cream['Sarah']
# Chunky Monkey
print ice_cream['Joe']
# Vanilla
print ice_cream['Hello']

如果没有Key在字典中，会自动输出Default Function的值。我们也可以直接在生成字典的时候直接定义一些key-value值对。