数据结构第十六讲程序的一个错误点
Status GetMidNode(LinkList L, ElemType *e){
LinkList search, mid;
mid = search = L;
while (search->next != NULL)
{
//search移动的速度是 mid 的2倍
if (search->next->next != NULL)
{
search = search->next->next;
mid = mid->next;
}
else
{
search = search->next;
这里也需要加一个mid = mid->next
}
}
*e = mid->data;
return OK;
}
过来看看一起学习 一下啊:smile:smile:smile:smile:smile 过来看看
页:
[1]