[LeetCode] 430. Flatten a Multilevel Doubly Linked

curried 發(fā)布于2019-08-16 13:50 / 2709人閱讀

摘要：

Problem

You are given a doubly linked list which in addition to the next and previous pointers, it could have a child pointer, which may or may not point to a separate doubly linked list. These child lists may have one or more children of their own, and so on, to produce a multilevel data structure, as shown in the example below.

Flatten the list so that all the nodes appear in a single-level, doubly linked list. You are given the head of the first level of the list.

Example:

Input:
 1---2---3---4---5---6--NULL
         |
         7---8---9---10--NULL
             |
             11--12--NULL

Output:
1-2-3-7-8-11-12-9-10-4-5-6-NULL

Note:

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

    public Node() {}

    public Node(int _val,Node _prev,Node _next,Node _child) {
        val = _val;
        prev = _prev;
        next = _next;
        child = _child;
    }
};
*/

Solution - Recursive

class Solution {
    public Node flatten(Node head) {
        Node dummy = head;
        while (head != null) {
            Node next = head.next;
            
            if (head.child != null) {
                Node child = flatten(head.child);
                head.child = null;
                head.next = child;
                child.prev = head;
                while (head.next != null) head = head.next;
            } 
            
            if (next != null) {
                head.next = next;
                next.prev = head;
            }
            head = head.next;
        }
        return dummy;
    }
}

GPU云服務器云服務器 Doubly Multilevel Flatten linked

文章版權歸作者所有，未經(jīng)允許請勿轉載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉載請注明本文地址：http://systransis.cn/yun/72409.html

leetcode430. Flatten a Multilevel Doubly Linked Li

摘要：步驟如下代碼如下思路二循環(huán)上面的思路同樣可以通過循環(huán)的方式來解決?；静襟E如下代碼如下思路減少遍歷次數(shù)之前的兩種思路，都會出現(xiàn)大量的重復遍歷，重復遍歷和葉子節(jié)點的深度成正相關，可以想方法將重復遍歷的次數(shù)減少。題目要求 You are given a doubly linked list which in addition to the next and previous pointe...

gxyz 2019-08-16 18:29 評論0 收藏0
LeetCode 430：扁平化多級雙向鏈表 Flatten a Multilevel Doubly

摘要：您將獲得一個雙向鏈表，除了下一個和前一個指針之外，它還有一個子指針，可能指向單獨的雙向鏈表。扁平化列表，使所有結點出現(xiàn)在單級雙鏈表中。您將獲得一個雙向鏈表，除了下一個和前一個指針之外，它還有一個子指針，可能指向單獨的雙向鏈表。這些子列表可能有一個或多個自己的子項，依此類推，生成多級數(shù)據(jù)結構，如下面的示例所示。扁平化列表，使所有結點出現(xiàn)在單級雙鏈表中。您將獲得列表第一級的頭部。 Yo...

sugarmo 2019-08-19 10:11 評論0 收藏0
LeetCode 430：扁平化多級雙向鏈表 Flatten a Multilevel Doubly

摘要：您將獲得一個雙向鏈表，除了下一個和前一個指針之外，它還有一個子指針，可能指向單獨的雙向鏈表。扁平化列表，使所有結點出現(xiàn)在單級雙鏈表中。您將獲得一個雙向鏈表，除了下一個和前一個指針之外，它還有一個子指針，可能指向單獨的雙向鏈表。這些子列表可能有一個或多個自己的子項，依此類推，生成多級數(shù)據(jù)結構，如下面的示例所示。扁平化列表，使所有結點出現(xiàn)在單級雙鏈表中。您將獲得列表第一級的頭部。 Yo...

dabai 2019-07-31 11:31 評論0 收藏0
[LeetCode] 426. Convert BST to Sorted Doubly Linke

Problem Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list. Lets take the foll...

MartinDai 2019-08-16 13:28 評論0 收藏0
[LintCode/LeetCode] Flatten Binary Tree to Linked

Problem Flatten a binary tree to a fake linked list in pre-order traversal.Here we use the right pointer in TreeNode as the next pointer in ListNode. Example 1 1 ...

TNFE 2019-08-14 15:12 評論0 收藏0