剑指 Offer 35. 复杂链表的复制
请实现 copyRandomList 函数,复制一个复杂链表。在复杂链表中,每个节点除了有一个 next 指针指向下一个节点,还有一个 random 指针指向链表中的任意节点或者 null。
示例 1:
输入:head = [[7,null],[13,0],[11,4],[10,2],[1,0]]
输出:[[7,null],[13,0],[11,4],[10,2],[1,0]]
示例 2:
输入:head = [[1,1],[2,1]]
输出:[[1,1],[2,1]]
示例 3:
输入:head = [[3,null],[3,0],[3,null]]
输出:[[3,null],[3,0],[3,null]]
示例 4:
输入:head = []
输出:[]
解释:给定的链表为空(空指针),因此返回 null。
提示:
-10000 <= Node.val <= 10000
Node.random 为空(null)或指向链表中的节点。
节点数目不超过 1000 。
注意:本题与主站 138 题相同:https://leetcode-cn.com/problems/copy-list-with-random-pointer/
/*
// 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 null;}
// HashMap<Node, Node> map = new HashMap<>();
// Node cur = head;
// while(cur != null) {
// Node nodeNew = new Node(cur.val);
// map.put(cur, nodeNew);
// cur = cur.next;
// }
// cur = head;
// while(cur != null) {
// Node curNew = map.get(cur);
// curNew.next = map.get(cur.next);
// curNew.random = map.get(cur.random);
// cur = cur.next;
// }
// return map.get(head);
// }
// }
// 解法二 O(1)空间复杂度,A->B->C 变 A->A`->B->B`->C->C`
// 三次遍历
class Solution {
public Node copyRandomList(Node head) {
if(head == null) {return null;}
Node cur = head;
while(cur != null) { // 复制
Node nodeNew = new Node(cur.val);
Node next = cur.next;
cur.next = nodeNew;
nodeNew.next = next;
cur = next;
}
// cur = head;
// while(cur != null) {
// System.out.println(cur.val);
// cur = cur.next;
// }
cur = head;
while(cur != null) { // 2.复制random节点
Node curNew = cur.next;
curNew.random = cur.random == null ? null : cur.random.next;
cur = curNew.next;
}
cur = head.next;
Node pre = head, res = head.next;
while(cur.next != null) { // 3. 分离
// Node nodeOld = cur.next;
pre.next = pre.next.next;
cur.next = cur.next.next;
cur = cur.next;
pre = pre.next;
// nodeOld.next = null;
}
pre.next = null;
return res;
}
}