【LeetCode】 116. Populating Next Right Pointers in Each Node 填充每个节点的下一个右侧节点指针（Medium）（JAVA）

【LeetCode】 116. Populating Next Right Pointers in Each Node 填充每个节点的下一个右侧节点指针（Medium）（JAVA）

题目地址: https://leetcode.com/problems/populating-next-right-pointers-in-each-node/

题目描述：

You are given a perfect binary tree where all leaves are on the same level, and every parent has two children. The binary tree has the following definition:

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}

Populate each next pointer to point to its next right node. If there is no next right node, the next pointer should be set to NULL.

Initially, all next pointers are set to NULL.

Follow up:

You may only use constant extra space.
Recursive approach is fine, you may assume implicit stack space does not count as extra space for this problem.

Example 1:

Input: root = [1,2,3,4,5,6,7]
Output: [1,#,2,3,#,4,5,6,7,#]
Explanation: Given the above perfect binary tree (Figure A), your function should populate each next pointer to point to its next right node, just like in Figure B. The serialized output is in level order as connected by the next pointers, with '#' signifying the end of each level.

Constraints:

• The number of nodes in the given tree is less than 4096.
• -1000 <= node.val <= 1000

题目大意

给定一个完美二叉树，其所有叶子节点都在同一层，每个父节点都有两个子节点。二叉树定义如下：

struct Node {
  int val;
  Node *left;
  Node *right;
  Node *next;
}

填充它的每个 next 指针，让这个指针指向其下一个右侧节点。如果找不到下一个右侧节点，则将 next 指针设置为 NULL。

初始状态下，所有 next 指针都被设置为 NULL。

解题方法

1. 这一题和层序遍历没啥区别，用类似的解法即可
2. 用一个 nodes 列表记录当前层次的元素，用 count 记录当前层级的个数，每次 count == 0 表示当前层次遍历结束，开始下一层
3. 用 pre 表示前一个元素，pre.next = cur，把所有的 next 接起来，当时需要在 count == 0 的时候把 pre 置位 null，因为要开始下一层了

class Solution {
    public Node connect(Node root) {
        if (root == null) return null;
        List<Node> nodes = new ArrayList<>();
        int count = 1;
        nodes.add(root);
        Node pre = null;
        while (nodes.size() > 0) {
            Node cur = nodes.remove(0);
            if (pre != null) pre.next = cur;
            pre = cur;
            count--;
            if (cur.left != null) nodes.add(cur.left);
            if (cur.right != null) nodes.add(cur.right);
            if (count == 0) {
                count = nodes.size();
                pre = null;
            }
        }
        return root;
    }
}

执行耗时:6 ms,击败了5.86% 的Java用户
内存消耗:38.5 MB,击败了81.53% 的Java用户

欢迎关注我的公众号，LeetCode 每日一题更新