代码拉取完成,页面将自动刷新
# Time: ctor: O(1)
# birth: O(1)
# death: O(1)
# inherit: O(n)
# Space: O(n)
import collections
class ThroneInheritance(object):
def __init__(self, kingName):
"""
:type kingName: str
"""
self.__king = kingName
self.__family_tree = collections.defaultdict(list)
self.__dead = set()
def birth(self, parentName, childName):
"""
:type parentName: str
:type childName: str
:rtype: None
"""
self.__family_tree[parentName].append(childName)
def death(self, name):
"""
:type name: str
:rtype: None
"""
self.__dead.add(name)
def getInheritanceOrder(self):
"""
:rtype: List[str]
"""
result = []
stk = [self.__king]
while stk: # preorder traversal
node = stk.pop()
if node not in self.__dead:
result.append(node)
if node not in self.__family_tree:
continue
for child in reversed(self.__family_tree[node]):
stk.append(child)
return result
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。