复杂链表的复制



/**
 * Definition for singly-linked list with a random pointer.
 * class RandomListNode {
 *     int label;
 *     RandomListNode next, random;
 *     RandomListNode(int x) { this.label = x; }
 * };
 */
import java.util.HashMap;
public class Solution {
    public RandomListNode copyRandomList(RandomListNode head) {
if(head == null)
    		return null;
        HashMap<RandomListNode,RandomListNode> map = new HashMap<RandomListNode,RandomListNode>();
        RandomListNode cur = head;
        RandomListNode headCopy = new RandomListNode(head.label),curCopy=headCopy;
        map.put(cur, headCopy);
        cur = cur.next;
        while(cur != null){
        	RandomListNode temp = new RandomListNode(cur.label);
        	curCopy.next = temp;
        	curCopy = temp;
        	map.put(cur, curCopy);
        	cur = cur.next;       	
        }
        cur = head;
        curCopy = headCopy;
        while(cur != null){
            if(cur.random!=null)
        	curCopy.random = map.get(cur.random);
        	cur = cur.next;
        	curCopy = curCopy.next;
        }
        return headCopy;
    }
}

题目描述


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.

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

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值