-
Notifications
You must be signed in to change notification settings - Fork 0
/
200205-1.cpp
115 lines (108 loc) · 2.02 KB
/
200205-1.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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-list/
#include <cstdio>
#include <vector>
using namespace std;
struct TreeNode {
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
TreeNode* create(initializer_list<int> a)
{
if (a.size() == 0) return NULL;
auto it = a.begin();
if (*it <= 0) return NULL;
TreeNode* t = new TreeNode(*it);
vector<TreeNode*> parents{t};
vector<TreeNode*> children;
++it;
for (size_t i = 0; it != a.end();) {
if (i < parents.size() * 2) {
TreeNode* c = (*it <= 0 ? NULL : new TreeNode(*it));
TreeNode* n = parents[i / 2];
if (i % 2 == 0) { n->left = c; } else { n->right = c; }
if (c) children.push_back(c);
++i; ++it;
} else {
parents = children;
children.clear();
i = 0;
}
}
return t;
}
void release(TreeNode* t)
{
if (t) {
release(t->left);
release(t->right);
delete t;
}
}
void print(TreeNode* t)
{
vector<TreeNode*> a{t};
int last = 0;
for (int i = 0;;) {
int end = a.size();
for (; i < end; ++i) {
a.push_back(a[i] ? a[i]->left : NULL);
a.push_back(a[i] ? a[i]->right : NULL);
if (a[i]) {
if (a[i]->right) last = a.size() - 1;
else if (a[i]->left) last = a.size() - 2;
}
}
if (last < end) break;
}
a.resize(last + 1);
printf("[ ");
for (auto e : a) {
if (e) {
printf("%d ", e->val);
} else {
printf("null ");
}
}
printf("]\n");
}
void print(const vector<vector<int>>& a)
{
printf("[\n");
for (const auto& r : a) {
printf(" [ ");
for (auto e : r) {
printf("%d ", e);
}
printf("]\n");
}
printf("]\n");
}
class Solution {
public:
void flatten(TreeNode* root) {
if (!root) return;
flatten(root->left);
flatten(root->right);
if (root->left) {
TreeNode* p = root->left;
while (p->right) p = p->right;
p->right = root->right;
root->right = root->left;
root->left = NULL;
}
}
};
int main()
{
Solution s;
{
TreeNode* t = create({1,2,5,3,4,NULL,6});
print(t);
s.flatten(t);
print(t);
release(t);
}
return 0;
}