leetcode面试题37 二叉树的序列化和反序列化

二叉树的序列化和反序列化

题目
请实现两个函数，分别用来序列化和反序列化二叉树。

思路
题目的示例是层次遍历，主要就是层次遍历的过程中考虑怎么序列化和反序列化。
反序列化的时候，需要将字符串分割为对应的值或者null（用到了字符串分割）。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Codec {
public:

    // Encodes a tree to a single string.
    string serialize(TreeNode* root) {
        if(!root) 
            return "[]";
        string s("[");
        deque<TreeNode*> que;
        que.push_back(root);
        TreeNode* tmp;
        while(!que.empty())
        {
            tmp = que.front();
            que.pop_front();
            if(tmp)
            {
                que.push_back(tmp->left);
                que.push_back(tmp->right);
                s += to_string(tmp->val) + ",";
            }
            else
                s+="null,";
        }
        s[s.size()-1] = ']';
        return s;
    }
    
    // Decodes your encoded data to tree.
    void stringsplit(string& s, vector<string>& val)
    {
        size_t id1 = 1, id2 = s.find(",", 1);
        while(id2!=string::npos)
        {
            val.push_back(s.substr(id1, id2-id1));
            id1 = id2 + 1;
            id2 = s.find(",", id1);
        }
        if(id1 != 1)
            val.push_back(s.substr(id1, s.size()-id1-1));
    }
    TreeNode* getnode(string& s)
    {
        if(s == "null")
            return nullptr;
        return new TreeNode(stoi(s));
    }
    TreeNode* deserialize(string data) {
        vector<string> val;
        stringsplit(data, val);
        if(val.size() == 0)
            return nullptr;
        deque<TreeNode*> que;
        int idx = 0;
        TreeNode* root = getnode(val[idx++]), *node;
        que.push_back(root);
        while(!que.empty())
        {
            node = que.front();
            que.pop_front();
            if(node)
            {
                node->left = getnode(val[idx++]);
                node->right = getnode(val[idx++]);
                que.push_back(node->left);
                que.push_back(node->right);
            }
        }
        return root;
    }
};

// Your Codec object will be instantiated and called as such:
// Codec codec;
// codec.deserialize(codec.serialize(root));