本文共 579 字，大约阅读时间需要 1 分钟。

题目：（简单）

标签：数组

解法一（双集合）：

def destCity(self, paths: List[List[str]]) -> str:    maybe = set()    wrong = set()    for path in paths:        wrong.add(path[0])        maybe.add(path[1])    return (maybe - wrong).pop()

解法二（增加跳出循环，提高效率）：

def destCity(self, paths: List[List[str]]) -> str:    paths = list(zip(*paths))    wrong = set(paths[0])    for path in paths[1]:        if path not in wrong:            return path

转载地址：https://dataartist.blog.csdn.net/article/details/107160233 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！