复杂链表的复制

大概就是在每个原节点后复制一个新的节点，复制好之后再将链表拆为两个
代码如下：

struct ComplexListNode
{
	int val;
	ComplexListNode* next;
	ComplexListNode* random;
	ComplexListNode(int x):val(x),next(nullptr),random(nullptr){}

};
class solution
{
public:
	ComplexListNode* clone(ComplexListNode* head)
	{
		ComplexListNode* cur = head;
		ComplexListNode* newNode = nullptr;
		ComplexListNode* Next = nullptr;
		ComplexListNode* newNodeNext = nullptr;//下一次复制的节点
		ComplexListNode* newhead = nullptr;
	//复制原链表中的每一个节点
		while(cur!=nullptr)
		{
			newNode = new ComplexListNode(cur->val);
			newNode->next = cur->next;
			cur->next = newNode;//指向下一个节点
			cur = newNode->next;
		}
		cur = head;
		while(cur!=nullptr)
		{
			if(cur->random!=nullptr)
			{
				newNode = cur->next;
				newNode->random = cur->random->next;
			}
			cur - cur->next->next;
		}
		//将两个链表拆开
		cur = head;
		while(cur != nullptr)
		{
			newNode = cur->next;
			Next = cur->next->next;
			if(Next==nullptr)
			{
				newNodeNext= nullptr;
			}
			else
			{
				newNodeNext = Next->next;
			}
			cur->next = Next;
			newNode->next = newNodeNext;
			cur = Next;
		}
		return newNode;
	}
};

leetcode用到了回溯法+哈希表的方法

class Solution {
public:
    unordered_map<Node*,Node*> map;
    Node* copyRandomList(Node* head) {
        if(head==nullptr)
        {
            return nullptr;   
        }
        if(!map.count(head))
        {
            Node* newnode = new Node(head->val);
            map[head] = newnode;
            newnode->next = copyRandomList(head->next);
            newnode->random = copyRandomList(head->random);
        }
        return map[head];
        
    }
};