剑指offer面试题35：复杂链表的复制

面试题35：复杂链表的复制

题目：请实现函数 ComplexListNode* Clone(ComplexListNode* pHead)，复制一个复杂链表。在复杂链表中，每个节点除了有一个 m_pNext 指针指向下一个节点，还有一个 m_pSibling 指针指向链表中的任意节点或者 nullptr，节点的 C++ 定义如下：

struct ComplexListNode {
	int m_nValue;
	ComplexListNode* m_pNext;
	ComplexListNode* m_pSibling;
};

思路一：

1. 第一步根据 m_pNext 创建链表。
2. 第二步创建节点的 m_pSibling 指针。假设节点 N 指向 节点S，那么在复制的链表中通过从头往后找找到节点 S`。这种方法的时间复杂度是 O(n^2)。

代码实现：

package Question35;

public class T01 {
    public static void main(String[] args) {
        ComplexListNode node1 = new ComplexListNode(1);
        ComplexListNode node2 = new ComplexListNode(2);
        ComplexListNode node3 = new ComplexListNode(3);

        node1.next = node2;
        node2.next = node3;
        node1.sibling = node3;
        node2.sibling = node1;

        ComplexListNode root = solve(node1);
    }

    public static ComplexListNode solve(ComplexListNode root) {
        if(root == null) return null;
        ComplexListNode croot = new ComplexListNode(root.value);
        ComplexListNode temp = root;
        ComplexListNode ctemp = croot;
        while(temp.next != null) {
            ComplexListNode cnxt = new ComplexListNode(temp.next.value);
            ctemp.next = cnxt;
            temp = temp.next;
            ctemp = ctemp.next;
        }
        temp = root;
        ctemp = croot;
        while(temp != null) {
            ComplexListNode csibling = null;
            if(temp.sibling != null) {
                ComplexListNode tempN = root;
                ComplexListNode ctempN = croot;
                while(tempN != temp.sibling) {
                    tempN = tempN.next;
                    ctempN = ctempN.next;
                }
                csibling = ctempN;
            }
            ctemp.sibling = csibling;
            temp = temp.next;
            ctemp = ctemp.next;
        }
        return croot;
    }
}

class ComplexListNode {
    int value;
    ComplexListNode next;
    ComplexListNode sibling;

    public ComplexListNode(int value) {
        this.value = value;
    }
}

思路二：

1. 通过 m_pNext 创建链表，同时创建一个 <N, N`> 的哈希表。
2. 在创建 sibling 指针时，通过哈希表能快速找到新建链表中

代码实现：

package Question35;

import java.util.HashMap;

public class T01 {
    public static void main(String[] args) {
        ComplexListNode node1 = new ComplexListNode(1);
        ComplexListNode node2 = new ComplexListNode(2);
        ComplexListNode node3 = new ComplexListNode(3);

        node1.next = node2;
        node2.next = node3;
        node1.sibling = node3;
        node2.sibling = node1;

        ComplexListNode root = solve1(node1);
        System.out.println("123");
    }
    public static ComplexListNode solve1(ComplexListNode root) {
        if(root == null) return null;
        ComplexListNode croot = new ComplexListNode(root.value);
        HashMap<ComplexListNode, ComplexListNode> map = new HashMap<>();
        ComplexListNode temp = root;
        ComplexListNode ctemp = croot;
        map.put(temp, ctemp);
        while(temp.next != null) {
            ComplexListNode nxt = new ComplexListNode(temp.next.value);
            ctemp.next = nxt;
            map.put(temp.next, nxt);
            temp = temp.next;
            ctemp = ctemp.next;
        }
        temp = root;
        ctemp = croot;
        while(temp != null) {
            ctemp.sibling = map.get(temp.sibling);
            temp = temp.next;
            ctemp = ctemp.next;
        }
        return root;
    }
}

class ComplexListNode {
    int value;
    ComplexListNode next;
    ComplexListNode sibling;

    public ComplexListNode(int value) {
        this.value = value;
    }
}

思路三：

在原始节点的后面插入新的节点，然后将这个链表拆成两部分即可。

代码实现：

package Question35;

import java.util.HashMap;

public class T01 {
    public static void main(String[] args) {
        ComplexListNode node1 = new ComplexListNode(1);
        ComplexListNode node2 = new ComplexListNode(2);
        ComplexListNode node3 = new ComplexListNode(3);

        node1.next = node2;
        node2.next = node3;
        node1.sibling = node3;
        node2.sibling = node1;

        ComplexListNode root = solve2(node1);
        System.out.println("123");
    }
    public static ComplexListNode solve2(ComplexListNode root) {
        if(root == null) return null;
        ComplexListNode temp = root;
        ComplexListNode ctemp;
        while(temp != null) {
            ctemp = new ComplexListNode(temp.value);
            ctemp.next = temp.next;
            temp.next = ctemp;
            temp = ctemp.next;
        }
        temp = root;
        while(temp != null) {
            if(temp.sibling != null) temp.next.sibling = temp.sibling.next;
            temp = temp.next.next;
        }
        ComplexListNode root2 = root.next;
        temp = root;
        ctemp = root2;
        while(ctemp.next != null) {
            temp.next = temp.next.next;
            ctemp.next = temp.next.next;
            temp = temp.next;
            ctemp = ctemp.next;
        }
        temp.next = null;
        ctemp.next = null;
        return root2;
    }
}
class ComplexListNode {
    int value;
    ComplexListNode next;
    ComplexListNode sibling;

    public ComplexListNode(int value) {
        this.value = value;
    }

    @Override
    public String toString() {
        return "ComplexListNode{" +
                "value=" + value +
                '}';
    }
}