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.

思路：
对链表进行三次扫描，第一次扫描对每个结点进行复制，然后把复制出来的新节点接在原结点的next，也就是让链表变成一个重复链表，就是新旧更替；第二次扫描中我们把旧结点的随机指针赋给新节点的随机指针，因为新结点都跟在旧结点的下一个，所以赋值比较简单，就是node.next.random = node.random.next，其中node.next就是新结点，因为第一次扫描我们就是把新结点接在旧结点后面。现在我们把结点的随机指针都接好了，最后一次扫描我们把链表拆成两个，第一个还原原链表，而第二个就是我们要求的复制链表。因为现在链表是旧新更替，只要把每隔两个结点分别相连，对链表进行分割即可。这个方法总共进行三次线性扫描，所以时间复杂度是O(n)。而这里并不需要额外空间，所以空间复杂度是O(1)。

/**
 * 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 head;  
        RandomListNode node = head;  
        
        while(node != null)  
        {  
            RandomListNode newNode = new RandomListNode(node.label);  
            newNode.next = node.next;  
            node.next = newNode;  
            node = newNode.next;  
        }  
        node = head;  
        
        while(node != null)  
        {  
            if(node.random != null)  
                node.next.random = node.random.next;  
            node = node.next.next;  
        }  
        RandomListNode newHead = head.next;  
        node = head;  
        
        while(node != null)  
        {  
            RandomListNode newNode = node.next;  
            node.next = newNode.next;  
            if(newNode.next != null)  
                newNode.next = newNode.next.next;  
            node = node.next;  
        }  
        
        return newHead;  
    }
}

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

    public Node() {}

    public Node(int _val,Node _next,Node _random) {
        val = _val;
        next = _next;
        random = _random;
    }
};
*/
class Solution {
    public Node copyRandomList(Node head) {
        if(head == null) return null;
        
        Node cur = head;
        while(cur != null) {
            Node copy = new Node(cur.val, cur.next, null);
            cur.next = copy;
            cur = cur.next.next;
        }
        
        cur = head;
        while(cur != null) {
            if(cur.random != null) {
                cur.next.random = cur.random.next;
            }
            cur = cur.next.next;
        }
        
        cur = head;
        Node dummy = new Node(0, null, null);
        Node copy = dummy;
        while(cur != null) {
            copy.next = cur.next;
            cur.next = cur.next.next;
            copy = copy.next;
            cur = cur.next;
        }
        return dummy.next;
    }
}