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.

这题要求深拷贝一个带有random指针的链表random可能指向空，也可能指向链表中的任意一个节点。

方法一：迭代 Runtime: 2 ms  beats 73.46% of java submissions.

	public RandomListNode copyRandomList(RandomListNode head) {
		RandomListNode iter = head, next;
		// First round: make copy of each node,
		// and link them together side-by-side in a single list.
		while (iter != null) {
			next = iter.next;
			RandomListNode copy = new RandomListNode(iter.label);
			iter.next = copy;
			copy.next = next;
			iter = next;
		}
		// Second round: assign random pointers for the copy nodes.
		iter = head;
		while (iter != null) {
			if (iter.random != null) iter.next.random = iter.random.next;
			iter = iter.next.next;
		}
		// Third round: restore the original list, and extract the copy list.
		iter = head;
		RandomListNode pseudoHead = new RandomListNode(0);
		RandomListNode copy, copyIter = pseudoHead;
		while (iter != null) {
			next = iter.next.next;
			copy = iter.next;    // extract the copy
			copyIter.next = copy;
			copyIter = copy;
			iter.next = next;    // restore the original list
			iter = next;
		}
		return pseudoHead.next;
	}

方法一可以参考下图： 点击打开链接查看图片

方法二：使用map  Runtime:  9 ms

	public RandomListNode copyRandomList(RandomListNode head) {
		if (head == null) return null;

		Map<RandomListNode, RandomListNode> map = new HashMap<RandomListNode, RandomListNode>();

		// loop 1. copy all the nodes
		RandomListNode node = head;
		while (node != null) {
			map.put(node, new RandomListNode(node.label));
			node = node.next;
		}

		// loop 2. assign next and random pointers
		node = head;
		while (node != null) {
			map.get(node).next = map.get(node.next);
			map.get(node).random = map.get(node.random);
			node = node.next;
		}

		return map.get(head);
	}