****链表问题,救命啊
刚学链表,遇到一个看不懂的题目,哪位高手能够帮我填空并且注释一下基本意思,万分感谢。
填空:lookit函数用来寻找在3个整数链表中均出现的第一个相同的整数,假定3个链表已经按递增的次序排列。
Typedef stuct elem
{ Int value;
Sruct elem * next;} ELEM;
Lookit(t1,t2,t3)
ELEM *t1,*t2,*t3;
{
int found,exitit;
found=0;
while(________(1)______________&!found)
{
if(_________(2)______________)
t1=t1->next;
else if (__________(3)___________)
t2=t2—>next;
else found=1;
if(found) {
found=0;exitit=1;
while (t3&&!found&&exitit)
if (t3—>value==t1->value)
found=1;
else if (______(4)__________)
t3=t3->next;
else {________(5)_________;exitit=0;}
}
}
if (found) return(t->value);
}