LeetCode 138 Copy List with Random Pointer (链表)

A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.

Construct a deep copy of the list. The deep copy should consist of exactly n brand new nodes, where each new node has its value set to the value of its corresponding original node. Both the next and random pointer of the new nodes should point to new nodes in the copied list such that the pointers in the original list and copied list represent the same list state. None of the pointers in the new list should point to nodes in the original list.

For example, if there are two nodes X and Y in the original list, where X.random --> Y, then for the corresponding two nodes x and y in the copied list, x.random --> y.

Return the head of the copied linked list.

The linked list is represented in the input/output as a list of n nodes. Each node is represented as a pair of [val, random_index] where:

• val: an integer representing Node.val
• random_index: the index of the node (range from 0 to n-1) that the random pointer points to, or null if it does not point to any node.

Your code will only be given the head of the original linked list.

Example 1:

Input: head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
Output: [[7,null],[13,0],[11,4],[10,2],[1,0]]

Example 2:

Input: head = [[1,1],[2,1]]
Output: [[1,1],[2,1]]

Example 3:

Input: head = [[3,null],[3,0],[3,null]]
Output: [[3,null],[3,0],[3,null]]

Example 4:

Input: head = []
Output: []
Explanation: The given linked list is empty (null pointer), so return null.

Constraints:

• 0 <= n <= 1000
• -10000 <= Node.val <= 10000
• Node.random is null or is pointing to some node in the linked list.

题目链接：https://leetcode.com/problems/copy-list-with-random-pointer/

题目大意：给一个带随机指针的链表，要求对其进行复制，复制完成后生成全新的节点

题目分析：三次遍历

第一次遍历将各节点复制，复制的节点接到当前节点后，比如1->2->3变为1->1->2->2->3->3

第二次遍历连上随机指针：cur.next.random = cur.random.next

第三次遍历进行拆分：cur.next = cur.next.next

0ms，时间击败100%

/*
// 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) {
        if (head == null) {
            return head;
        }
        Node pre = head;
        while (pre != null) {
            Node nxt = pre.next;
            Node cur = new Node(pre.val);
            pre.next = cur;
            cur.next = nxt;
            pre = nxt;
        }
        
        Node cur = head;
        while (cur != null) {
            if (cur.random != null) {
                cur.next.random = cur.random.next;
            }
            cur = cur.next.next;
        }
        Node ans = head.next;
        pre = head;
        cur = head.next;
        while (pre != null) {
            if (pre.next != null) {
                pre.next = pre.next.next;
            }
            pre = pre.next;
            if (cur.next != null) {
                cur.next = cur.next.next;
            }
            cur = cur.next;
        }
        return ans;
    }
}