-
Notifications
You must be signed in to change notification settings - Fork 14
/
Copy path297-gusrb3164.cpp
91 lines (85 loc) · 2 KB
/
297-gusrb3164.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
#define INF 200000
class Codec
{
public:
// Encodes a tree to a single string.
string serialize(TreeNode *root)
{
queue<TreeNode *> q;
string result = "";
q.push(root);
while (!q.empty())
{
TreeNode *cur = q.front();
q.pop();
if (cur == nullptr)
{
result += "# ";
}
else
{
result += (to_string(cur->val) + " ");
q.push(cur->left);
q.push(cur->right);
}
}
return result;
}
// Decodes your encoded data to tree.
TreeNode *deserialize(string data)
{
if (data == "" || data[0] == '#')
{
return nullptr;
}
// cout<<data<<endl;
vector<TreeNode *> nums;
stringstream ss(data);
string temp;
while (getline(ss, temp, ' '))
{
if (temp == "#")
{
nums.push_back(nullptr);
}
else
{
nums.push_back(new TreeNode(stoi(temp)));
}
}
TreeNode *result = nums[0];
queue<TreeNode *> q;
q.push(result);
int idx = 0;
while (!q.empty())
{
TreeNode *node = q.front();
q.pop();
idx++;
if (nums[idx])
{
node->left = nums[idx];
q.push(node->left);
}
idx++;
if (nums[idx])
{
node->right = nums[idx];
q.push(node->right);
}
}
return result;
}
};
// Your Codec object will be instantiated and called as such:
// Codec ser, deser;
// TreeNode* ans = deser.deserialize(ser.serialize(root));