题目
题目太长了,直接放链接吧 https://leetcode.com/problems/throne-inheritance/
解法:
这道题目实际上是个树的preorder visit,然后储存的时候用字典的方式来保存父节点和子节点之间的关系
一开始写的时候TLE了,先看看错误的写法:
class ThroneInheritance:
def __init__(self, kingName: str):
self.d = collections.defaultdict(list)
self.death_list = []
self.kingName = kingName
self.inherit_list = [kingName]
def birth(self, parentName: str, childName: str) -