【编程题】复杂链表的复制（Java实现）

【编程题】复杂链表的复制（Java实现）

题目来源

剑指offer第25题
https://www.nowcoder.com/questionTerminal/f836b2c43afc4b35ad6adc41ec941dba

题目描述

输入一个复杂链表（每个节点中有节点值，以及两个指针，一个指向下一个节点，另一个特殊指针指向任意一个节点），返回结果为复制后复杂链表的head。（注意，输出结果中请不要返回参数中的节点引用，否则判题程序会直接返回空）

题目代码

/*
public class RandomListNode {
    int label;
    RandomListNode next = null;
    RandomListNode random = null;

    RandomListNode(int label) {
        this.label = label;
    }
}
*/
public class Solution {
    public RandomListNode Clone(RandomListNode pHead)
    {
        if(pHead==null)
            return pHead;
        RandomListNode print=new RandomListNode(0);
        RandomListNode current=print;
        while(pHead!=null){
            current.next=new RandomListNode(pHead.label);
            current=current.next;
            if(pHead.random!=null)
                current.random=new RandomListNode(pHead.random.label);
            pHead=pHead.next;
        }
        return print.next;
    }
}

//使用hashMap
import java.util.*;
/*
public class RandomListNode {
    int label;
    RandomListNode next = null;
    RandomListNode random = null;

    RandomListNode(int label) {
        this.label = label;
    }
}
*/
public class Solution {
    public RandomListNode Clone(RandomListNode pHead)
    {
        if(pHead==null)
            return pHead;
        Mapmap=new HashMap<>();
        RandomListNode current=pHead;
        RandomListNode head=new RandomListNode(0);
        RandomListNode print=head;
        while(current!=null){
            head.next=new RandomListNode(current.label);
            map.put(current,head.next);
            current=current.next;
        }
        current=pHead;
        while(current!=null){
            print.next=map.get(current);
            print.next.random=map.get(current.random);
            current=current.next;
            print=print.next;
        }
        return head.next;
        
    }
}

import java.util.*;
/*
public class RandomListNode {
    int label;
    RandomListNode next = null;
    RandomListNode random = null;

    RandomListNode(int label) {
        this.label = label;
    }
}
*/
public class Solution {
    public RandomListNode Clone(RandomListNode pHead)
    {
        if(pHead==null)
            return pHead;
        Mapmap=new HashMap<>();
        RandomListNode current=pHead;
        while(current!=null){
            map.put(current,new RandomListNode(current.label));
            current=current.next;
        }
        current=pHead;
        while(current!=null){
            map.get(current).next=map.get(current.next);
            map.get(current).random=map.get(current.random);
            current=current.next;
        }
        return map.get(pHead);
        
    }
}