复制带随机指针的链表

import java.util.HashMap;
public class copylistwithRandom { //复制链表
  public static class Node {
    public int value;
    public Node next;
    public Node rand;

    public Node(int data) { this.value = data; }
  }
  //方法一:哈希表
  public static Node copyListWithRand1(Node head) {
    HashMap<Node, Node> map = new HashMap<Node, Node>();
    Node cur = head;

    while (cur != null) {
      map.put(cur, new Node(cur.value));
      cur = cur.next;
    }
    cur = head;
    while (cur != null) {
      map.get(cur).next = map.get(cur.next);
      map.get(cur).rand = map.get(cur.rand);
      cur = cur.next;
    }
    return map.get(head);
  }
  //方法二:节约空间的操作
  public static Node copyListWithRand2(Node head) {
    if (head == null)
      return null;
    Node cur = head;
    Node next = null;
    // copy node and link to every node
    while (cur != null) { // 节点复制
      next = cur.next;
      cur.next = new Node(cur.value);
      cur.next.next = next;
      cur = next;
    }
    cur = head;
    Node curCopy = null;
    // set copy node rand
    while (cur != null) {
      next = cur.next.next;
      curCopy = cur.next;
      curCopy.rand = cur.rand != null ? cur.rand : null;
      cur = next;
    }
    Node res = head.next;
    cur = head;
    while (cur != null) {
      next = cur.next.next;
      curCopy = cur.next;
      cur.next = next;
      curCopy.next = next != null ? next.next : null;
      cur = next;
    }
    return res;
  }
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值