题目描述
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
1. 复制结点并将新节点放在原结点的后面,如图():
2、复制随机节点:
3、把复制的链表和原来的链表分开:
# -*- coding:utf-8 -*-
# class RandomListNode:
# def __init__(self, x):
# self.label = x
# self.next = None
# self.random = None
class Solution:
# 返回 RandomListNode
def Clone(self, pHead):
# write code here
if not pHead:
return None
tHead = pHead
while tHead != None:
newNode = RandomListNode(tHead.label)
newNode.next = tHead.next
tHead.next = newNode
tHead = newNode.next
tHead = pHead
while tHead != None:
if tHead.random != None:
tHead.next.random = tHead.random.next
tHead = tHead.next.next
tHead = pHead
ans = pHead.next
while tHead.next != None:
tmp = tHead.next
tHead.next = tmp.next
tHead = tmp
return ans
附一个简单的测试样例:
p1 = RandomListNode("A") p2 = RandomListNode("B") p3 = RandomListNode("C") p1.next = p2 p2.next = p3 p1.random = p3 p2.random = p1 p3.random = p2 sol = Solution() sol.Clone(p1)
参考博客: