【2022初春】【LeetCode】430. 扁平化多级双向链表

递归，居然一次写出来了，注意细节，比如child要变null，cnt可能为null

/*
// Definition for a Node.
class Node {
    public int val;
    public Node prev;
    public Node next;
    public Node child;
};
*/

class Solution {
    public Node flatten(Node head) {
        //if(head==null) return null;
        Node node = head;
        while(node!=null){
            if(node.child==null){
                node = node.next;
            }else{
                node.child.prev = node;               
                Node cnt = node.next;
                Node cur = flatten(node.child);
                node.child = null;
                node.next = cur;
                while(cur.next!=null) cur = cur.next;
                cur.next = cnt;
                if(cnt!=null) cnt.prev = cur;
                node = cnt;
            }
        }
        return head;
    }
}