leetcode::serialize_and_deserialize_binary_tree::Codec类 参考

#include <leetcode.h>

静态 Public 成员函数
static TreeNode *	deserialize (string data)
	Decodes your encoded data to tree. 更多...
static string	serialize (TreeNode *root)
	Encodes a tree to a single string. 更多...

详细描述

在文件 leetcode.h 第 2605 行定义.

成员函数说明

deserialize()

TreeNode * leetcode::serialize_and_deserialize_binary_tree::Codec::deserialize ( string  data )

static

Decodes your encoded data to tree.

在文件 leetcode.cpp 第 7045 行定义.

                                                {
            if(data == "[]") {
                return nullptr;
            }
            vector<string> vec;
            data            = data.substr(1, data.size() - 2);
            auto *const str = static_cast<char *>(malloc((data.length() + 1) * sizeof(char)));
            memcpy(str, data.c_str(), (data.length() + 1) * sizeof(char));
            for(const char *item = strtok(str, ","); item != nullptr; item = strtok(nullptr, ",")) {
                vec.emplace_back(string(item));
            }
            queue<TreeNode **> q;
            auto *root = new TreeNode(stoi(vec[0]));
            q.push(&root);
            for(const auto &str: vec) {
                auto *const node = q.front();
                q.pop();
                if(str == "null") {
                    *node = nullptr;
                } else {
                    *node = new TreeNode(stoi(str));
                    q.push(&(*node)->left);
                    q.push(&(*node)->right);
                }
            }
            return root;
        }

引用了 acwing::acwing836_408::root , 以及 pat::a::a7_2::vec.

被这些函数引用 leetcode::delete_node_in_a_bst::TEST() , 以及 leetcode::serialize_and_deserialize_binary_tree::TEST().

serialize()

string leetcode::serialize_and_deserialize_binary_tree::Codec::serialize ( TreeNode *  root )

static

Encodes a tree to a single string.

在文件 leetcode.cpp 第 7013 行定义.

                                              {
            if(root == nullptr) {
                return "[]";
            }
            vector<string> vec;
            ostringstream oss;
            oss << '[';
            queue<TreeNode *> q;
            q.push(root);
            while(!q.empty()) {
                const TreeNode *node = q.front();
                q.pop();
                if(node == nullptr) {
                    vec.emplace_back("null");
                    continue;
                }
                vec.emplace_back(to_string(node->val));
                q.push(node->left);
                q.push(node->right);
            }
            int end = vec.size() - 1;
            while(vec[end] == "null" && end > 0) {
                end--;
            }
            oss << vec[0];
            for(int i = 1; i <= end; i++) {
                oss << ',' << vec[i];
            }
            oss << ']';
            return oss.str();
        }

引用了 leetcode::TreeNode::left, leetcode::TreeNode::right, acwing::acwing836_408::root, leetcode::TreeNode::val , 以及 pat::a::a7_2::vec.

---

该类的文档由以下文件生成:

• leetcode.h
• leetcode.cpp