分成三个步骤
1).根据原始链表的每个结点N创建对应的N’,并把N’连在N的后面。
如下图:
2)看到上图我们就应该知道这个算法的巧妙之处了,B’.sbiling就记录在B.sbiling.next,这一步就是通过这个方法设置sbiling指针了。
3).将两个链表断开。
package 复杂链表的复制;
class Node{
int value;
Node next;
Node sbiling;
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
sb.append("value = " + value);
sb.append(", next = " + (next == null ? "null" : next.value));
sb.append(", sbiling = " + (sbiling == null ? "null" : sbiling.value));
return sb.toString();
}
}
public class CopyComplexListTest {
public static void copyList(Node head){
Node node = head;
while(node != null){
Node copyNode = new Node();
copyNode.value = node.value;
copyNode.next = node.next;
copyNode.sbiling = null;
node.next = copyNode;
node = copyNode.next;
}
}
public static void setSbiling(Node head){
Node node = head;
while(node != null){
Node copyNode = node.next;
if(node.sbiling != null){
copyNode.sbiling = node.sbiling.next;
}
node = copyNode.next;
}
}
public static Node disConnectList(Node head){
Node node = head;
Node copyHead = null;
Node copyNode = null;
if(node != null){
copyHead = node.next;
copyNode = node.next;
node.next = copyNode.next;
node = node.next;
}
while(node != null){
copyNode.next = node.next;
copyNode = copyNode.next;
node.next = copyNode.next;
node = node.next;
}
return copyHead;
}
public static Node copy(Node head){
copyList(head);
setSbiling(head);
return disConnectList(head);
}
public static void main(String[] args) {
Node head = new Node();
head.value = 1;
Node node2 = new Node();
node2.value = 2;
Node node3 = new Node();
node3.value = 3;
Node node4 = new Node();
node4.value = 4;
Node node5 = new Node();
node5.value = 5;
head.next = node2;
head.sbiling = node3;
node2.next = node3;
node2.sbiling = node5;
node3.next = node4;
node4.next = node5;
node4.sbiling = node2;
Node copyHead = copy(head);
Node node = copyHead;
while(node != null){
System.out.println(node);
node = node.next;
}
}
}