forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.cpp
47 lines (39 loc) · 905 Bytes
/
Solution.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
/*
// Definition for a Node.
class Node {
public:
int val;
Node* prev;
Node* next;
Node* child;
};
*/
class Solution {
public:
Node* flatten(Node* head) {
flattenGetTail(head);
return head;
}
Node* flattenGetTail(Node* head) {
Node* cur = head;
Node* tail = nullptr;
while (cur) {
Node* next = cur->next;
if (cur->child) {
Node* child = cur->child;
Node* childTail = flattenGetTail(cur->child);
cur->child = nullptr;
cur->next = child;
child->prev = cur;
childTail->next = next;
if (next)
next->prev = childTail;
tail = childTail;
} else {
tail = cur;
}
cur = next;
}
return tail;
}
};