Tech innovation

Deep copy of a linkedlist with random pointer

Posted by Yuanbo on February 7, 2020

深拷贝带随机指针的链表

三遍遍历。 O(n) time, O(n) space

分成3步：

  1. 复制节点，如A-B-C => A-A’-B-B’-C-C’
  2. 依次遍历节点A,B,C，将A’B’C’这些节点的随机指针与其一致 (A’.rand -> A.rand.next)
  3. 分离成 A-B-C 和 A’-B’-C’，A’-B’-C’便是所求链表

END

CATALOG
    FEATURED TAGS
    心情 Modbus JAVA 面试 技术 翻译 招聘 Blockchain User communities comment China Tech Conference sharing startup meetup training innovation Interview
    FRIENDS