[C++] #yyds干货盘点#算法大神对小码农说复制随机链表可以单独拿出来讲讲

struct Node* cur = head;
  if(!cur)
    return NULL;
  while(cur)
  {
    //每次我们都要malloc一个copy节点
    struct Node* copy = (struct Node*)malloc(sizeof(struct Node));
    //开始给数据
    copy->val = cur->val;
    //开始插入
    copy->next = cur->next;
    cur->next = copy;
    //开始cur移动
    cur = copy->next;
  }

//节点copy好后开始random相链
  cur = head;
  while(cur)
  {
    //重新把之前开辟的节点给copy维护
    struct Node* copy = cur->next;
    if(cur->random == NULL)
      copy->random = NULL;
    else
      copy->random = cur->random->next;//上面的GIF的核心代码     
    cur = copy->next;  
  }

//开始一个一个尾插起来
  struct Node* copyHead = NULL;
  struct Node* copyTail = NULL;
  cur = head;
  while(cur)
  {
    //重新把之前开辟的节点给copy维护
    struct Node* copy = cur->next;
    //这边你需要一个next来还原原来链表顺序，你不能用完人家对人家不负责任
    struct Node* next = copy->next;
    if(copyHead == NULL)
    {
      copyHead = copy;
      copyTail = copy;
    }
    else
    {
      copyTail->next = copy;
      copyTail = copy;
    }    
    cur->next = next;//这一步看你对原来链表负不负责任
    cur = next;
  }
  return copyHead;

Node* copyRandomList(struct Node* head) {
  struct Node* cur = head;
  if(!cur)
    return NULL;
  while(cur)
  {
    //每次我们都要malloc一个copy节点
    struct Node* copy = (struct Node*)malloc(sizeof(struct Node));
    //开始给数据
    copy->val = cur->val;
    //开始插入
    copy->next = cur->next;
    cur->next = copy;
    //开始cur移动
    cur = copy->next;
  }
  //节点copy好后开始random相链
  cur = head;
  while(cur)
  {
    //重新把之前开辟的节点给copy维护
    struct Node* copy = cur->next;
    if(cur->random == NULL)
      copy->random = NULL;
    else
      copy->random = cur->random->next;//上面的GIF的核心代码     
    cur = copy->next;  
  }
  //开始一个一个尾插起来
  struct Node* copyHead = NULL;
  struct Node* copyTail = NULL;
  cur = head;
  while(cur)
  {
    //重新把之前开辟的节点给copy维护
    struct Node* copy = cur->next;
    //这边你需要一个next来还原原来链表顺序，你不能用完人家对人家不负责任
    struct Node* next = copy->next;
    if(copyHead == NULL)
    {
      copyHead = copy;
      copyTail = copy;
    }
    else
    {
      copyTail->next = copy;
      copyTail = copy;
    }    
    cur->next = next;//这一步看你对原来链表负不负责任
    cur = next;
  }
  return copyHead;
}

</div>
    
    <div id="asideoffset"></div>