1-Description
输入一个复杂链表(每个节点中有节点值,以及两个指针,一个指向下一个节点,另一个特殊指针指向任意一个节点),返回结果为复制后复杂链表的head。(注意,输出结果中请不要返回参数中的节点引用,否则判题程序会直接返回空)
struct RandomListNode {
int label;
struct RandomListNode *next, *random;
RandomListNode(int x) :
label(x), next(NULL), random(NULL) {
}
};
2-Solution
- 暴力方法
1-复制正常的链表指针域:从头开始遍历所有节点
2-复制随机指针域,由于指针随机指向,无法通过一次遍历实现,故采用暴力方法
class Solution {
public:
RandomListNode* FindInNew(RandomListNode *oldHead,RandomListNode *newHead,RandomListNode *randNode){
RandomListNode *curNode = oldHead;
RandomListNode *newNode = newHead;
while(curNode != NULL && newNode != NULL){
if(randNode == curNode){
return newNode;
}
curNode = curNode->next;
newNode = newNode->next;
}
return NULL;
}
RandomListNode* Clone(RandomListNode* pHead)
{
if(pHead == NULL) return NULL;
RandomListNode *curNode = pHead;
RandomListNode *newHead = NULL,*preNode = NULL,*newNode = NULL;
//首复制普通指针域,一次遍历
while(curNode != NULL){
newNode = new RandomListNode(curNode->label);
curNode = curNode->next;
if(preNode == NULL){
newHead = newNode;
}
else{
preNode->next = newNode;
}
preNode = newNode;
}
//接着复制随机指针域,需要两次遍历
curNode = pHead;
newNode = newHead;
while(curNode != NULL && newNode != NULL){
RandomListNode *randNode = curNode->random;//随机指针域randNode
RandomListNode *newRandNode = FindInNew(pHead,newHead,randNode);//查到新链表中与randNode对应的指针域
newNode->random = newRandNode;
//链表同步移动
curNode = curNode->next;
newNode = newNode->next;
}
return newHead;
}
};