Repository navigation
Expand file tree
/
Copy pathlc_117.cpp
More file actions
143 lines (135 loc) · 2.42 KB
/
Copy pathlc_117.cpp
File metadata and controls
143 lines (135 loc) · 2.42 KB
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
/**
* Definition for binary tree with next pointer.
* struct TreeLinkNode {
* int val;
* TreeLinkNode *left, *right, *next;
* TreeLinkNode(int x) : val(x), left(NULL), right(NULL), next(NULL) {}
* };
*/
class Solution {
public:
void connect(TreeLinkNode *root) {
if( root == NULL)
return;
root->next = NULL;
TreeLinkNode* last = root;
TreeLinkNode* tra = root, *temp=NULL;
while(tra)
{
if( tra->left)
{
if( tra->right )
{
tra->left->next = tra->right;
}
else{
tra->left->next = NULL;
temp = tra->next;
while( temp )
{
if(temp->left)
{
tra->left->next = temp->left;
break;
}
if( temp->right)
{
tra->left->next = temp->right;
break;
}
temp = temp->next;
}
}
}
if( tra->right )
{
if( tra->next)
{
tra->right->next = NULL;
temp = tra->next;
while( temp )
{
if( temp->left)
{
tra->right->next = temp->left;
break;
}
if( temp->right)
{
tra->right->next = temp->right;
break;
}
temp = temp->next;
}
}
else
tra->right->next = NULL;
}
if( tra->next )
{
tra = tra->next;
}
else
{
if( last->left)
{
tra = last->left;
last = last->left;
continue;
}
else if( last->right)
{
tra = last->right;
last = last->right;
continue;
}
else
{
tra = NULL;
while( last->next )
{
last = last->next;
if( last->left)
{
tra = last->left;
last = last->left;
break;
}
if( last->right)
{
tra = last->right;
last = last->right;
break;
}
}
}
}
}
}
};
/**
*using a pre pointer and a head pointer may simplify the code
*
*a brilliant java solution
*public void connect(TreeLinkNode root) {
* TreeLinkNode dummyHead = new TreeLinkNode(0);
* TreeLinkNode pre = dummyHead;
* while (root != null) {
* if (root.left != null) {
* pre.next = root.left;
* pre = pre.next;
* }
* if (root.right != null) {
* pre.next = root.right;
* pre = pre.next;
* }
* root = root.next;
* if (root == null) {
* pre = dummyHead;
* root = dummyHead.next;
* dummyHead.next = null;
* }
* }
*}
*
*/