- 题目:请实现两个函数,分别用来序列化和反序列化二叉树
- idea
- 先序遍历,采用带引用的idx记录当前序列下标
- 当结点为空时,用’#'标记,并返回
- 由于char为一个字节,而int为8个字节。当结点非空时用四个单位来保存int数值,分别右移24、16、8、0位然后跟255进行与运算。反序列化时则将这四个单位分别左移然后跟255与运算,最后或起来。(这种做法有一个bug,假如前八位与’#'相等时就GG了哈哈)
- 反序列化时(ans[idx++]&255)一定要先与255,否则char转成int时会先把成了有符号数(如255就会成了-106,高位的全成了1)。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
int maxn = 1000000;
class Solution {
public:
void S(TreeNode *root, char *ans, int &idx){
if (!root) {
ans[idx++] = '#';
return;
}
int val = root->val;
ans[idx++] = (val>>24)&255;
ans[idx++] = (val>>16)&255;
ans[idx++] = (val>>8)&255;
ans[idx++] = val&255;
ans[idx++] = ',';
S(root->left, ans, idx);
S(root->right, ans, idx);
}
TreeNode* D(char *ans, int &idx){
if (!ans || idx<0) return 0;
if (ans[idx] == '#'){
idx++; return NULL;
}
int v = (ans[idx++]&255)<<24;
v = v | (ans[idx++]&255)<<16;
v = v | (ans[idx++]&255)<<8;
v = v | (ans[idx++]&255);
idx++;
TreeNode* root = new TreeNode(v);
root->left = D(ans, idx);
root->right = D(ans, idx);
return root;
}
char* Serialize(TreeNode *root) {
if (!root) return 0;
char *ans = (char*)malloc(maxn*sizeof(char));
int idx = 0;
S(root, ans, idx);
return ans;
}
TreeNode* Deserialize(char *str) {
if (!str) return 0;
int idx=0;
TreeNode* root = D(str, idx);
return root;
}
};