LeetCode 430 Flatten a Multilevel Doubly Linked List (dfs 链表)

最新推荐文章于 2024-10-08 10:36:00 发布

_TCgogogo_

最新推荐文章于 2024-10-08 10:36:00 发布

阅读量352

点赞数 1

分类专栏： LeetCode dfs/bfs Leetcode Medium 文章标签： leetcode dfs 链表

本文链接：https://blog.csdn.net/tc_to_top/article/details/123190674

版权

LeetCode 同时被 3 个专栏收录

334 篇文章 5 订阅

订阅专栏

Leetcode Medium

244 篇文章 0 订阅

订阅专栏

dfs/bfs

16 篇文章 0 订阅

订阅专栏

该博客主要介绍了如何解决LeetCode上的一个挑战，即如何将一个多级的双向链表拉平成单级链表。通过深度优先搜索（DFS）策略，可以有效地将带有子链表的节点进行重新排列，确保子链表的节点出现在其父节点之后，父节点之前。代码实现中，使用了递归方法来遍历和重组链表，最终返回拉平后的链表头节点。此问题考察了链表操作和递归算法的理解。

摘要由CSDN通过智能技术生成

You are given a doubly linked list, which contains nodes that have a next pointer, a previous pointer, and an additional child pointer. This child pointer may or may not point to a separate doubly linked list, also containing these special nodes. 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.

Given the head of the first level of the list, flatten the list so that all the nodes appear in a single-level, doubly linked list. Let curr be a node with a child list. The nodes in the child list should appear after curr and before curr.next in the flattened list.

Return the head of the flattened list. The nodes in the list must have all of their child pointers set to null.

Example 1:

Input: head = [1,2,3,4,5,6,null,null,null,7,8,9,10,null,null,11,12]
Output: [1,2,3,7,8,11,12,9,10,4,5,6]
Explanation: The multilevel linked list in the input is shown.
After flattening the multilevel linked list it becomes:

Example 2:

Input: head = [1,2,null,3]
Output: [1,3,2]
Explanation: The multilevel linked list in the input is shown.
After flattening the multilevel linked list it becomes:

Example 3:

Input: head = []
Output: []
Explanation: There could be empty list in the input.

Constraints:

The number of Nodes will not exceed 1000.
1 <= Node.val <= 10^5

How the multilevel linked list is represented in test cases:

We use the multilevel linked list from Example 1 above:

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

The serialization of each level is as follows:

[1,2,3,4,5,6,null]
[7,8,9,10,null]
[11,12,null]

To serialize all levels together, we will add nulls in each level to signify no node connects to the upper node of the previous level. The serialization becomes:

[1,    2,    3, 4, 5, 6, null]
             |
[null, null, 7,    8, 9, 10, null]
                   |
[            null, 11, 12, null]

Merging the serialization of each level and removing trailing nulls we obtain:

[1,2,3,4,5,6,null,null,null,7,8,9,10,null,null,11,12]

题目链接：https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/

题目大意：将一个带child的双向链表按照题意拉平

题目分析：按照题意dfs即可，注意链表边界

1ms，时间击败30%

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

class Solution {
    
    public Node dfs(Node head) {
        Node pre = head;
        while (head != null) {
            if (head.child != null) {
                Node nxt = head.next;
                head.next = head.child;
                head.child.prev = head;
                head.child = null;
                Node last = dfs(head.next);
                last.next = nxt;
                if (nxt != null) {
                    nxt.prev = last;
                }
            }
            pre = head;
            head = head.next;
        }
        return pre;
    }
    
    public Node flatten(Node head) {
        Node ans = head;
        dfs(head);
        return ans;
    }
}