查找两个链表相同部分【面试题】

//链表节点
public class Node {
    //当前节点值
    public int value;
    //指向的下一个节点
    public Node next;

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

/**
 * @author java后端技术栈
 * @date 2019/8/17
 */
public class FindListCommon {
    

    private static void findCommon(Node head1, Node head2) {
        System.out.println("开始查找:");
        while (head1 != null && head2 != null) {
            if (head1.value < head2.value) {
                head1 = head1.next;
            } else if (head1.value > head2.value) {
                head2 = head2.next;
            } else {
                System.out.print(head1.value);
                System.out.print(" ");
                head1 = head1.next;
                head2 = head2.next;
            }
        }
        System.out.println();
        System.out.println("查找完毕");
    }
    
    public static void main(String[] args) {

        Node node1 = new Node(1);
        Node node2 = new Node(2);
        Node node4 = new Node(4);
        Node node5 = new Node(5);
        Node node6 = new Node(6);
        //构建一个链表，顺序为：0 1 2 4 5 6
        Node head1 = new Node(0);
        head1.next = node1;
        node1.next = node2;
        node2.next = node4;
        node4.next = node5;
        node5.next = node6;

        Node node11 = new Node(1);
        Node node22 = new Node(2);
        Node node33 = new Node(3);
        Node node55 = new Node(5);
        Node node66 = new Node(6);
        //构建一个链表，顺序为：0 1 2 3 5 6
        Node head2 = new Node(0);
        head2.next = node11;
        node11.next = node22;
        node22.next = node33;
        node33.next = node55;
        node55.next = node66;
        findCommon(head1, head2);
    }
}

开始查找:
0 1 2 5 6
查找完毕