题目:输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
思路:遍历链表然后创建对象。
public class Solution {
public RandomListNode Clone(RandomListNode pHead)
{
RandomListNode node = null;
if(pHead!=null){
node = new RandomListNode(pHead.label);
RandomListNode tempHead = pHead;
RandomListNode tempNode = node;
while(tempHead.next!=null){
tempNode.next = new RandomListNode(tempHead.next.label);
tempNode.random = tempHead.random==null?null:new RandomListNode(tempHead.random.label);
tempHead = tempHead.next;
tempNode = tempNode.next;
}
}
return node;
}
}
递归法:
public class Solution {
public RandomListNode Clone(RandomListNode pHead)
{
RandomListNode node = null;
if(pHead!=null){
node = new RandomListNode(pHead.label);
node.random = pHead.random==null?null:new RandomListNode(pHead.random.label);
node.next = Clone(pHead.next);
}
return node;
}
}