文章目录
给定两个有序列表的头指针head1和head2，打印两个链表的公共部分。
以下为具体算法实现：
public class PrintCommonPart {
public class Node{
public int value;
public Node next;
public Node (int data){
this.value=data;
}
}
public void printCommonPart(Node head1,Node head2){
System.out.print("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.print(head1.value+" ");
head1=head1.next;
head2=head2.next;
}
}
System.out.println();
}
}
|
