public class Demo {
    // 链表1的头指针
    private static Node firstNode1;
    // 链表2的头指针
    private static Node firstNode2;
    public static void main(String[] args) {
        init();
        Node mergeNode = findMergeNode();
        if (mergeNode == null) {
            System.out.println("两个链表未合并");
        } else {
            System.out.println("两个链表是合并的，合并结点为:" + mergeNode.getValue());
        }
    }
    // 查找合并结点
    private static Node findMergeNode() {
        Node current1 = firstNode1;
        while (current1 != null) {
            Node current2 = firstNode2;
            while (current2 != null) {
                if (current1 == current2) {
                    return current1;
                }
                current2 = current2.getNext();
            }
            current1 = current1.getNext();
        }
        return null;
    }
    // 初始化两个链表
    private static void init() {
        Node mergeFirst = createList(new String[]{"x", "y", "z"}, null);
        firstNode1 = createList(new String[]{"a", "b"}, mergeFirst);
        firstNode2 = createList(new String[]{"d", "e", "f"}, mergeFirst);
    }
    private static Node createList(String[] array, Node mergeFirst) {
        Node first = new Node();
        Node current = first;
        for (int i = 0; i < array.length; i++) {
            current.setValue(array[i]);
            if (i < array.length - 1) {
                Node next = new Node();
                current.setNext(next);
                current = next;
            } else {
                current.setNext(mergeFirst);
            }
        }
        return first;
    }
}
public class Node {
    private String value;
    private Node next;
    public String getValue() {
        return value;
    }
    public void setValue(String value) {
        this.value = value;
    }
    public Node getNext() {
        return next;
    }
    public void setNext(Node next) {
        this.next = next;
    }
    @Override
    public String toString() {
        return this.value;
    }
}