[刷题]Copy List with Random Pointer

[LintCode]Copy List with Random Pointer

Version I HashMap

/**
 * 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 {
    /**
     * @param head: The head of linked list with a random pointer.
     * @return: A new head of a deep copy of the list.
     */
    public RandomListNode copyRandomList(RandomListNode head) {
        // 2015-4-26 O(n)
        if (head == null) {
            return null;
        }
        HashMap<RandomListNode, RandomListNode> map = new HashMap<>(); 
        RandomListNode dummy = new RandomListNode(0); // 新链表
        RandomListNode tail = dummy; // 新链表
        RandomListNode newNode;
        // 一次遍历
        while (head != null) {
            if (map.containsKey(head)) {
                newNode = map.get(head);
            } else {
                newNode = new RandomListNode(head.label);
                map.put(head, newNode);
            }
            tail.next = newNode;
            if (head.random != null) {
                if (map.containsKey(head.random)) {
                    newNode = map.get(head.random);
                } else {
                    newNode = new RandomListNode(head.random.label);
                    map.put(head.random, newNode);
                }
                tail.next.random = newNode;
            }
            head = head.next;
            tail = tail.next;
        }
        
        return dummy.next;
    }
}

Version II no HashMap

/**
 * 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 {  
    /**
     * 遍历链表，将每一个节点复制一份，并插进原链表，插在被复制节点的下一个节点的位置，
     * 链表的长度将变为原来的二倍。
     */
    private void copyNode(RandomListNode head) {  
        while (head != null) {  
            RandomListNode newNode = new RandomListNode(head.label);  
            newNode.random = head.random;  
            newNode.next = head.next;  
            head.next = newNode;  
            head = head.next.next;  
        }  
    }  
    
    /**
     * 遍历链表，修正新节点的ramdom指针
     */
    private void copyRandom(RandomListNode head) {  
        while (head != null) {  
            if (head.next.random != null) {  
                head.next.random = head.random.next;  
            }  
            head = head.next.next;  
        }  
    }  
    
    /**
     * 遍历链表，将链表一分为二，将所有新节点分出来，并修正其next指针
     */
    private RandomListNode splitList(RandomListNode head) {  
        RandomListNode newHead = head.next;  
        while (head != null) {  
            RandomListNode temp = head.next;  
            head.next = temp.next;  
            head = head.next;  
            if (temp.next != null) {  
                temp.next = temp.next.next;  
            }  
        }  
        return newHead;  
    }  
    
    /**
     * Copy List with Random Pointer 
     */
    public RandomListNode copyRandomList(RandomListNode head) {  
        if (head == null) {  
            return null;  
        }  
        copyNode(head);  
        copyRandom(head);  
        return splitList(head);  
    }  
}