1600. 皇位继承顺序

最新推荐文章于 2022-06-30 10:07:16 发布

michael - z

最新推荐文章于 2022-06-30 10:07:16 发布

阅读量171

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/zmh908264302/article/details/118141340

版权

leetcode 专栏收录该内容

81 篇文章 0 订阅

订阅专栏

文章目录

1600. 皇位继承顺序

题目描述

在这里插入图片描述

解题思路

1、哈希表保存父子间的关系
2、保存死亡名单
3、前序遍历多叉树获取继承顺序并排除已死亡人员

代码实现

class ThroneInheritance:

    def __init__(self, kingName: str):
        self.king = kingName
        self.deathed = set()
        self.nodes = defaultdict(list)

    def birth(self, parentName: str, childName: str) -> None:
        self.nodes[parentName].append(childName)
        # brother = self.nodes.get(parentName, None)
        # if brother:
        #     brother.append(childName)
        # else:
        #     brother = []
        # self.nodes[parentName] = brother

    def death(self, name: str) -> None:
        self.deathed.add(name)

    def getInheritanceOrder(self) -> List[str]:
        self.ans = []
        def pre_order(name: str) -> None:
            if name not in self.deathed:
                self.ans.append(name)
            if name in self.nodes:
                for child in self.nodes[name]:
                    pre_order(child)
        
        pre_order(self.king)
        return self.ans

# Your ThroneInheritance object will be instantiated and called as such:
# obj = ThroneInheritance(kingName)
# obj.birth(parentName,childName)
# obj.death(name)
# param_3 = obj.getInheritanceOrder()