复杂链表的复制


/*
struct RandomListNode {
	int label;
	struct RandomListNode *next, *random;
	RandomListNode(int x) :
			label(x), next(NULL), random(NULL) {
	}
};
*/
class Solution {
public:
	RandomListNode* Clone(RandomListNode* pHead)
	{
        if(pHead == NULL)
            return pHead;
		cloneNext(pHead);
        cloneRandom(pHead);
        pHead = separate(pHead);
        return pHead;
	}
private:
    void cloneNext(RandomListNode* head){
       	while(head != NULL){
            RandomListNode* temp = new RandomListNode(head->label);
            temp->next = head->next;
            head->next = temp;
            head = temp->next;
        }
    }

    void cloneRandom(RandomListNode* head){
        while(head != NULL){
            if(head->random != NULL)
                head->next->random = head->random->next;
            head = head->next->next;
        }
    }

    RandomListNode* separate(RandomListNode* head){
        RandomListNode* temp = head->next;
        RandomListNode* newHead = head->next;
        while(newHead->next != NULL){
            head->next = newHead->next;
           	newHead->next = newHead->next->next;
            head = head->next;
            newHead = newHead->next;
        }
        head->next = NULL;
        return temp;
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值