LeetCode第138题复制带随机指针的链表

1. 算法
   迭代算法
2. 核心思想
   在每个结点后面做一个复制，然后复制每个结点的random，最后截断链表。
3. 代码

/*
// Definition for a Node.
class Node {
    int val;
    Node next;
    Node random;

    public Node(int val) {
        this.val = val;
        this.next = null;
        this.random = null;
    }
}
*/

class Solution {
    public Node copyRandomList(Node head) {
        Node firstHead = head;
        Node secondHead = head;
        while(firstHead != null){
            Node temp = new Node(firstHead.val);
            temp.next = firstHead.next;
            firstHead.next = temp;
            firstHead = firstHead.next.next;
        }

        while(secondHead != null){
            if(secondHead .random != null){
                secondHead.next.random = secondHead.random.next;
            }
            secondHead = secondHead.next.next;
        }

        Node result = new Node(0),cur = result;
        for(Node p = head;p != null;p = p.next){
            Node q = p.next;
            cur.next = q;
            cur = cur.next;
            p.next = q.next;
        }
        return result.next;

    }
}