leetcode: python 1436. Destination City

最新推荐文章于 2022-09-20 00:12:02 发布

JasonDecode

最新推荐文章于 2022-09-20 00:12:02 发布

阅读量86

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/weixin_43012796/article/details/112756198

版权

leetcode 专栏收录该内容

54 篇文章 0 订阅

订阅专栏

Destination City
Easy

You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any path outgoing to another city.

It is guaranteed that the graph of paths forms a line without any loop, therefore, there will be exactly one destination city.

Example 1:

Input: paths = [[“London”,“New York”],[“New York”,“Lima”],[“Lima”,“Sao Paulo”]]
Output: “Sao Paulo”
Explanation: Starting at “London” city you will reach “Sao Paulo” city which is the destination city. Your trip consist of: “London” -> “New York” -> “Lima” -> “Sao Paulo”.
Example 2:

Input: paths = [[“B”,“C”],[“D”,“B”],[“C”,“A”]]
Output: “A”
Explanation: All possible trips are:
“D” -> “B” -> “C” -> “A”.
“B” -> “C” -> “A”.
“C” -> “A”.
“A”.
Clearly the destination city is “A”.
Example 3:

Input: paths = [[“A”,“Z”]]
Output: “Z”

Use dfs to find the final destination

code:

class Solution:
    def destCity(self, paths: List[List[str]]) -> str:
        
        def dfs(paths, start):
            dest = start[1]
            index_start = paths.index(start)
            paths = paths[:index_start] + paths[index_start + 1:]
            for i in range(len(paths)):
                if paths[i][0] == dest:
                    start = paths[i]
                    return dfs(paths, start)
            return dest
        return dfs(paths, paths[0])