leetcode-430. 扁平化多级双向链表

扁平化多级双向链表

思路：
利用flatten_dfs(curr, curr.child)不断将child转化为prev和next，利用flatten_dfs(tail, tmpNext)将子链与父链连接起来。

代码：

"""
# Definition for a Node.
class Node:
    def __init__(self, val, prev, next, child):
        self.val = val
        self.prev = prev
        self.next = next
        self.child = child
"""

class Solution:
    def flatten(self, head: 'Node') -> 'Node':
        if not head:
            return head
        
        pseudoHead = Node(None, None, head, None)
        self.flatten_dfs(pseudoHead, head)
        pseudoHead.next.prev = None
        return pseudoHead.next

    def flatten_dfs(self, prev, curr):
        if not curr:
            return prev
        curr.prev = prev
        prev.next = curr

        tmpNext = curr.next
        tail = self.flatten_dfs(curr, curr.child)
        curr.child = None
        return self.flatten_dfs(tail, tmpNext)