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.

思路： 1. Add the new Node to every node's next;

2.  Copy the random pointer

3. Separate the two list

易错点： 1. 主要是因为复制之后要next.next. 因此 一定要判断当前node  是否null  否则就没有next 了。2. 注意 random 为空的情况， 注意尾节点最后一个的情况。

/**
 * Definition for singly-linked list with a random pointer.
 * class RandomListNode {
 *     int label;
 *     RandomListNode next, random;
 *     RandomListNode(int x) { this.label = x; }
 * };
 */
public class Solution {
    public RandomListNode copyRandomList(RandomListNode head) {
        if(head == null)
            return null;
        RandomListNode cur = head;
        //Create new node and insert the new node behind cur node
        while(cur != null){
            RandomListNode node = new RandomListNode(cur.label);
            node.next = cur.next;
            cur.next = node;
            cur = node.next;
        }
        //Copy the random node
        cur = head;
        while(cur != null){
            if(cur.random != null)//------
                cur.next.random = cur.random.next;
            cur = cur.next.next;
        }
        RandomListNode newHead = head.next;
        RandomListNode cur2 = newHead;
        cur = head;
        //Divide the list into 2 lists
        while(cur != null){
            cur.next = cur2.next;
            cur = cur.next;
            if(cur != null){//-------
                cur2.next = cur.next;
                cur2 = cur2.next;
            }
        }
        return newHead;
    }
}