LinkList Serch_lst_Common(LinkList L1, LinkList L2)
{
int len1 = Length(L1);
int len2 = Length(L2);
int dist;
LinkList longList, shortList;
if (len1 > len2)
{
longList = L1->next;
shortList = L2->next;
dist = len1 - len2;
}
else
{
longList = L2->next;
shortList = L1 -> next;
dist = len2 - len1;
}
while (dist--)
{
longList = longList->next;
}
while (longList != NULL)
{
if (longList == shortList)
return longList;
else
{
longList = longList->next;
shortList = shortList->next;
}
}
return NULL;
}
王道数据结构四十页第八题
最新推荐文章于 2024-04-13 02:53:43 发布