题号:剑指 Offer 35
题目名:复杂链表的复制
原题URL:https://leetcode-cn.com/problems/fu-za-lian-biao-de-fu-zhi-lcof/
题目描述
请实现 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]]
限制
- 2 <= n <= 100000
思路
1.想不出什么什么方法的时候,暴力法就完事了,全部遍历一遍把next复制出来,然后再复制random
2.优化:原地进行复制,将当前节点的复制体放在后面,先处理Next再处理random
3.分离节点
解题代码
public class Solution {
public Node copyRandomList(Node head) {
if(head==null) return null;
//暴力法,先复制一份带Next指针的链表
Node dummy = new Node(0);
Node cur1 = head;
//新链表的遍历结点
Node curr1 = dummy;
//复制带next的结点
while (cur1!=null) {
curr1.next = new Node(cur1.val);
curr1 = curr1.next;
cur1 = cur1.next;
}
Node cur2 = head;
Node curr2 = dummy.next;
//复制一份random结点
while (cur2!=null) {
if(cur2.random==null) {
curr2.random = null;
cur2 =cur2.next;
curr2 =curr2.next;
continue;
}
Node randomCur = head;
Node randomCurr = dummy.next;
//找到原表的随机结点
while(randomCur!=cur2.random) {
randomCur = randomCur.next;
randomCurr = randomCurr.next;
}
curr2.random = randomCurr;
cur2 =cur2.next;
curr2 =curr2.next;
}
return dummy.next;
}
}
优化代码
public Node copyRandomList(Node head) {
if(head==null) return null;
//优化原地复制,复制next的当前结点
for(Node curr = head,copy=null;curr!=null;curr = curr.next.next) {
//将当前结点复制一份放在当前结点的后面
copy = new Node(curr.val);
copy.next = curr.next;
curr.next = copy;
}
//处理结点的random结点
for(Node curr = head,copy=null;curr!=null;curr = curr.next.next) {
//遍历原始链表,原始链表的下一个结点就是新链表,那么他的随机结点就是当前节点的随机结点的复制品
if(curr.random!=null) curr.next.random = curr.random.next;
}
//将新的链表拿出来
Node newList = head.next;
for(Node curr = head,copy = null;curr != null && curr.next != null;) {
//分离两个链表
copy = curr.next;
curr.next = copy.next;
curr = copy;
}
return newList;
}