［算法最优］打印两个有序链表的公共部分

Github源码地址：

https://github.com/GeniusVJR/Algorithm-Optimal-Solution

package 打印两个有序链表的公共部分;

/** * 给定两个有序链表的头指针head1和head2， * 打印两个链表的公共部分 * @author dream * */
public class Solution {

    public static class Node
    {
        public int value;
        public Node next;
        public Node(int data)
        {
            this.value = data;
        }
    }

    public static void printCommonPart(Node head1,Node head2)
    {
        System.out.println("Common Part: ");
        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.println(head1.value + " ");
                head1 = head1.next;
                head2 = head2.next;
            }
        }
        System.out.println();
    }

}

这题比较简单，就是比较两个链表中节点的值来判断。