LeetCode 430. Flatten a Multilevel Doubly Linked List

最新推荐文章于 2024-09-23 21:44:13 发布

weixin_30507269

最新推荐文章于 2024-09-23 21:44:13 发布

阅读量93

点赞数

文章标签： c/c++

原文链接：http://www.cnblogs.com/hankunyan/p/11525406.html

版权

本题和 LeetCode 114. Flatten Binary Tree to Linked List 一模一样。doubly linked list 稍微复杂一点。

Recursive

PreOrder

和LC114一样，preorder来写的时候要copy next的指针。下面写法同时copy了child和next，是的思路更加简洁。

class Solution {
public:
    Node *prev=NULL;
    
    Node* flatten(Node* head) {
        if (head==NULL) return NULL;
        Node *child=head->child, *next=head->next;
        if (prev!=NULL){
            prev->next = head;
            head->prev = prev;
            prev->child = NULL;
        }
        prev = head;
        flatten(child);
        flatten(next);
        return head;
    }
};

PostOrder

(head, child, next) 反一反就是 (next, child, head)，用postorder递归来做。

class Solution {
public:
    Node *first=NULL;
    
    Node* flatten(Node* head) {
        if (head==NULL) return NULL;
        flatten(head->next);
        flatten(head->child);
        head->next = first;
        head->child = NULL;
        if (first!=NULL)
            first->prev = head;
        first = head;
        return first;
    }
};

如果不用全局变量，那么dfs函数需要一个参数记录first，https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/discuss/295912/C++-Simple-5-line-recursive-solution-(with-diagram)

Iterative

PreOrder

class Solution {
public:
    Node* flatten(Node* head) {
        if (head==NULL) return NULL;
        Node *prev=NULL;
        stack<Node *> s({head});
        while (!s.empty()){
            Node *cur=s.top(); s.pop();
            if (prev!=NULL){
                prev->next = cur;
                prev->child = NULL;
                cur->prev = prev;
            }
            prev = cur;
            if (cur->next) s.push(cur->next);
            if (cur->child) s.push(cur->child);
        }
        return head;
    }
};

Without Stack

class Solution {
public:
    Node* flatten(Node* head) {
        Node *p=head;
        while (p){
            if (p->child){
                Node *q=p->child;
                while (q->next) q=q->next;
                q->next = p->next;  if (p->next) p->next->prev = q;
                p->next = p->child; p->child->prev = p;
                p->child = NULL;
            }
            p = p->next;
        }
        return head;
    }
};