【剑指offer】序列化二叉树（树）

题目描述

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

链接

https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking

代码

/*
struct TreeNode {
    int val;
    struct TreeNode *left;
    struct TreeNode *right;
    TreeNode(int x) :
            val(x), left(NULL), right(NULL) {
    }
};
*/

class Solution {
public:
    vector<char> vc;
    char* Serialize(TreeNode *root) {
        if(root == NULL){
            return "#";
        }
        string now = to_string(root->val);
        now.push_back(',');
        char* left = Serialize(root->left);
        char* right = Serialize(root->right);
        char *res = new char[strlen(left) + strlen(right) + now.size()];
        strcpy(res, now.c_str());
        strcat(res, left);
        strcat(res, right);
        return res;
    }
    int p = 0;
    TreeNode* Deserialize(char *str) {
        if(str==NULL || str[p] == '#'){
            p++;
            return NULL;
        }
        int ans = 0;
        while(p < strlen(str) && str[p] != ','){
            ans = ans * 10 + (str[p]-'0');
            p++;
        }
        // cout << ans << endl;
        TreeNode* root = new TreeNode(ans);
        p++;
        root->left = Deserialize(str);
        root->right = Deserialize(str);
        return root;
    }
};