复制含有随机指针的单链表

• 问题描述
  复制含有随机指针的单链表。
• 解决方案1
  利用哈希表存储原来和新的指针，找到对应关系，进行随机指针的复制

public static Node copyRandomLinkedList1(Node head){
        HashMap<Node,Node> hashMap = new HashMap<>();
        Node res = new Node(head.value);
        hashMap.put(head,res);
        Node last = res;
        Node cur = head.next;
        while(cur != null){
            Node temp = new Node(cur.value);
            hashMap.put(cur,temp);
            last.next = temp;
            cur = cur.next;
            last = temp;
        }

        Node oldCur = head;
        Node newCur = res;
        while(oldCur != null){
            newCur.random = hashMap.get(oldCur.random);
            oldCur = oldCur.next;
            newCur = newCur.next;
        }
        return res;
    }

• 解决方案2

新链表挂在老链表每个节点的下一个，然后分离，注意边界条件

 public static Node copyRandomLinkedList2(Node head){
        Node res = new Node(head.value);
        res.next = head.next;
        head.next = res;
        Node cur = head.next.next;
        while(cur != null){
            Node temp = new Node(cur.value);
            temp.next = cur.next;
            cur.next = temp;
            cur = cur.next.next;
        }
        Node oldCur = head;
        Node newCur = res;
        while(oldCur != null){
            if (oldCur.random != null)
                oldCur.next.random = oldCur.random.next;
            oldCur = oldCur.next.next;
        }
        //解开新链表与老链表
        oldCur = head;
        newCur = res;
        while(oldCur.next.next != null){
            oldCur.next = oldCur.next.next;
            newCur.next = newCur.next.next;
            oldCur = oldCur.next;
            newCur = newCur.next;
        }
        oldCur.next = null;//解开尾结点与新链表的指针！！！
        return res;
    }

• 测试程序

 public static void main(String[] args){
        System.out.println(CopyRandomLinkedListTest());
    }
    
    public static boolean CopyRandomLinkedListTest(){
        Node head1 = new Node(1);
        head1.next = new Node(2);
        head1.next.next = new Node(3);
        head1.next.next.next = new Node(4);
        head1.next.next.next.next = new Node(5);
        head1.next.next.next.next.next = new Node(6);
        head1.next.next.next.next.next.next = new Node(8);
        head1.next.next.next.next.next.next.next = new Node(10);
        head1.next.next.next.next.next.next.next.next = new Node(13);
        head1.next.next.next.next.next.next.next.next.next = new Node(14);
        head1.next.next.next.next.next.next.next.next.next.next = new Node(14);
        head1.next.next.next.next.next.next.next.next.next.next.next = new Node(14);
        head1.next.next.next.next.next.next.next.next.next.next.next.next = new Node(15);
        head1.next.random = head1;
        head1.next.next.random =  head1.next.next.next.next.next.next.next.next.next;
        Node newHead = copyRandomLinkedList2(head1);
        while(newHead != null){
            if(!(head1 != null && head1.value == newHead.value && head1 != newHead && ((head1.random == null && newHead.random == null)
            || (head1.random != null && newHead.random != null && head1.random.value == newHead.random.value && head1.random != newHead.random))
                    ))
                return false;
            else{
                newHead = newHead.next;
                head1 = head1.next;
            }
        }
        if (head1 == null)
            return true;
        else
            return false;
    }