LeetCode(138) Copy List with Random Pointer 拷贝带有随机指针的链表

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Return a deep copy of the list.

public class l138_copy_list_with_random_pointer {
    class RandomListNode {
        int val;
        RandomListNode next, random;

        RandomListNode(int x) {
            this.val = x;
        }
    }

    public class Solution {
        public RandomListNode copyRandomList(RandomListNode head) {
            if (head == null) return head;
            //第一遍扫描：对每个结点进行复制，把复制出来的新结点插在原结点之后
            RandomListNode node = head;
            while (node != null) {

                //复制
                RandomListNode newnode = new RandomListNode(node.val);
                //插入
                newnode.next = node.next;
                node.next = newnode;
                //进行下一步
                node = newnode.next;
            }
            //第二遍扫描：根据原结点的random，给新结点的random赋值
            node = head;//初始指向头结点
            while (node != null) {
                if (node.random != null) {
                    node.next.random = node.random.next;//新节点random赋值
                    node = node.next.next;
                }
            }
            //第三遍扫描：把新结点从原链表中拆分出来
            RandomListNode newhead = head.next;
            node = head;
            while (node != null) {
                RandomListNode newnode = node.next;//新指针指向copy节点
                node.next = newnode.next;
                if (newnode.next != null) {
                    newnode.next = newnode.next.next;
                }
                node = node.next;
            }
            return newhead;


        }
    }
}