每日一题 430. 扁平化多级双向链表

430. 扁平化多级双向链表

简单

/*class Solution {
public:Node* flatten(Node* head) {Node* tail = nullptr;return dfs(head);}Node* dfs(Node* head){Node* cur = head;while(cur != nullptr){if(cur->child != nullptr){Node* curChild = getTail(cur->child);Node* temp = cur->next;cur->child->prev = cur;cur->next = cur->child;curChild->next = temp;if(temp != nullptr) {temp->prev = curChild;}cur->child = nullptr;}cur = cur->next;}return head;}Node* getTail(Node* head){while(head->next != nullptr){head = head->next;}return head;}
};