leetcode 1600. 王位继承顺序-内存100-Throne Inheritance

Problem: 1600. 王位继承顺序-内存100-Throne Inheritance

内存100%，通过观察可以发现，拿到所有父母对应的孩子，孩子越靠前年纪越大，只需要深度优先搜索即可，深度优先搜索得到的顺序就是最终的结果

Code

class ThroneInheritance { public: unordered_set<string> dea; unordered_map<string, vector<string>> parentchild; vector<string> curOrder; string king; ThroneInheritance(string kingName) { king = kingName; } void birth(string parentName, string childName) { parentchild[parentName].push_back(childName); } void death(string name) { dea.insert(name); } void Successor(string x) { if(dea.find(x) == dea.end()) curOrder.push_back(x); if(parentchild.count(x) != 0) { for(string& s : parentchild[x]) { Successor(s); } } } vector<string> getInheritanceOrder() { curOrder.clear(); Successor(king); return curOrder; } };