题目描述
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
思路很简单使用map进行记录,键对应原有链表节点,值对应copy链表中要用到的新对象。如果map中已经存储相应的值,进行复用,否则进行存储。
/*
public class RandomListNode {
int label;
RandomListNode next = null;
RandomListNode random = null;
RandomListNode(int label) {
this.label = label;
}
}
*/
import java.util.*;
public class Solution {
public RandomListNode Clone(RandomListNode pHead)
{
if(pHead==null)return null;
RandomListNode newHead = null;
RandomListNode oldList = pHead;
RandomListNode newList = null;
HashMap<RandomListNode,RandomListNode> map = new HashMap<RandomListNode,RandomListNode>();
while(oldList!=null){
if(newHead==null){
newHead = new RandomListNode(pHead.label);
newList = newHead;
map.put(pHead,newHead);
}else{
if(oldList.next!=null&&map.containsKey(oldList.next)){
newList.next = map.get(oldList.next);
}else{
if(oldList.next!=null){
RandomListNode tem = new RandomListNode(oldList.next.label);
newList.next = tem;
map.put(oldList.next,tem);
}
}
if(oldList.random!=null&&map.containsKey(oldList.random)){
newList.random = map.get(oldList.random);
}else{
if(oldList.random!=null){
RandomListNode randomTem = new RandomListNode(oldList.random.label);
newList.random = randomTem;
map.put(oldList.random,randomTem);
}
}
oldList = oldList.next;
newList = newList.next;
}
}
return newHead;
}
}