leetcode题目:Copy List with Random Pointer

题目:

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.

Return a deep copy of the list.

思路:

主要是深层复制的问题:

本题比较简单,具体实现见代码:

/**
 * Definition for singly-linked list with a random pointer.
 * struct RandomListNode {
 *     int label;
 *     RandomListNode *next, *random;
 *     RandomListNode(int x) : label(x), next(NULL), random(NULL) {}
 * };
 */
class Solution {
public:
    RandomListNode *copyRandomList(RandomListNode *head) {
        RandomListNode* pNode = head;
		map<RandomListNode*,RandomListNode*>node_map;
		if (pNode)
		{
			RandomListNode* NewHead = NULL;
			NewHead = new RandomListNode(pNode->label);
			node_map.insert(make_pair(pNode,NewHead));

			RandomListNode* pNewNode = NewHead;
			while (pNode->next)
			{
				pNode = pNode->next;
				RandomListNode* new_node = new RandomListNode(pNode->label);
				pNewNode->next = new_node;
				pNewNode = pNewNode->next;
				node_map.insert(make_pair(pNode,pNewNode));
			}
			pNode = head;
			pNewNode = NewHead;
			while (pNode)
			{
				if (pNode->random != NULL)
				{
					pNewNode->random = node_map.find(pNode->random)->second;
				}
				pNode = pNode->next;
				pNewNode = pNewNode->next;
			}
			return NewHead;
		}
		else
		{
			return NULL;
		}
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值