Copy List with Random Pointer (Java)

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.

这道题和clone graph那道题不同的地方在于，图可以dfs完成搜索，即直接判断node的neighbor是否在hashmap中，如果没有就加入并从此neighbor开始新的dfs递归，而链表如果根据random是否已经加入hashmap来判断的话，遍历会出现问题。所以只能先将所有的新旧链表都加入hashmap再遍历一遍进行random的赋值。尤其注意，复制品的random必须是复制品，不能是正品，即直接把正品的random赋值给复制品。

Source

/**
 * 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;
        HashMap<RandomListNode, RandomListNode> map = new HashMap<RandomListNode, RandomListNode>();
        RandomListNode a = new RandomListNode(head.label);
        map.put(head, a);
        
        RandomListNode p = head.next;
        RandomListNode newhead = a;
        while(p != null){
        	RandomListNode b = new RandomListNode(p.label);
        	map.put(p, b);
        	a.next = b;
        	
        	p = p.next;
        	a = a.next;
        }
        
        p = head;
        a = newhead;
        while(p != null){
        	a.random = map.get(p.random);  //p.random的复制品赋给复制品的random
        	p = p.next;
        	a = a.next;
        }
        return newhead;
    }
}

Test

    public static void main(String[] args){
    	RandomListNode a = new RandomListNode(1);
    	a.next = new RandomListNode(2);
    	a.next.next = new RandomListNode(3);
    	a.next.next.next = new RandomListNode(4);
    	a.next.next.next.next = new RandomListNode(5);
    	a.next.random = a.next.next.next;
    	
    	RandomListNode b = new Solution().copyRandomList(a);
    	while(b != null){
    		if(b.random == null) System.out.println("null");
    		else System.out.println(b.random.label);
    		b = b.next;
    	}
    }