[LeetCode] Serialize and Deserialize N-ary Tree N叉搜尋樹的序列化和去序列化 LeetCode All in One 題目講解彙總(持續更新中...)
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be reconstructed later in the same or another computer environment.
Design an algorithm to serialize and deserialize an N-ary tree. An N-ary tree is a rooted tree in which each node has no more than N children. There is no restriction on how your serialization/deserialization algorithm should work. You just need to ensure that an N-ary tree can be serialized to a string and this string can be deserialized to the original tree structure.
For example, you may serialize the following 3-ary
tree
as [1 [3[5 6] 2 4]]
. You do not necessarily need to follow this format, so please be creative and come up with different approaches yourself.
Note:
N
is in the range of[1, 1000]
- Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.
這道題讓我們對N叉樹進行序列化和去序列化,序列化就是將一個數據結構或物體轉化為一個位序列,可以存進一個檔案或者記憶體緩衝器中,然後通過網路連線在相同的或者另一個電腦環境中被還原,還原的過程叫做去序列化。現在讓我們來序列化和去序列化一個二叉樹,並給了我們例子。由於我們有了之前那道Serialize and Deserialize Binary Tree
解法一:
class Codec { public: // Encodes a tree to a single string. string serialize(Node* root) { string res; serializeHelper(root, res); return res; } void serializeHelper(Node* node, string& res) { if (!node) res += "#"; else { res += to_string(node->val) + " " + to_string(node->children.size()) + " "; for (auto child : node->children) { serializeHelper(child, res); } } } // Decodes your encoded data to tree. Node* deserialize(string data) { istringstream iss(data); return deserializeHelper(iss); } Node* deserializeHelper(istringstream& iss) { string val = "", size = ""; iss >> val; if (val == "#") return NULL; iss >> size; Node *node = new Node(stoi(val), {}); for (int i = 0; i < stoi(size); ++i) { node->children.push_back(deserializeHelper(iss)); } return node; } };
解法二:
class Codec { public: // Encodes a tree to a single string. string serialize(Node* root) { if (!root) return "#"; string res; queue<Node*> q{{root}}; while (!q.empty()) { Node *t = q.front(); q.pop(); res += to_string(t->val) + " " + to_string(t->children.size()) + " "; for (Node *child : t->children) { q.push(child); } } return res; } // Decodes your encoded data to tree. Node* deserialize(string data) { istringstream iss(data); queue<Node*> qNode; queue<int> qSize; string val = "", size = ""; iss >> val; if (val == "#") return NULL; iss >> size; Node *res = new Node(stoi(val), {}), *cur = res; qNode.push(cur); qSize.push(stoi(size)); while (!qNode.empty()) { Node *t = qNode.front(); qNode.pop(); int len = qSize.front(); qSize.pop(); for (int i = 0; i < len; ++i) { if (!(iss >> val)) break; if (!(iss >> size)) break; if (val != "#") { cur = new Node(stoi(val), {}); qNode.push(cur); qSize.push(stoi(size)); t->children.push_back(cur); } } } return res; } };
類似題目:
Serialize and Deserialize Binary Tree
Encode N-ary Tree to Binary Tree