65,187
社区成员




List *FindMid(const List *Head)
{
int i=0;
List *Tmp,*result;
if (Head->Next == NULL) return NULL;
Tmp = Head->Next;
result = NULL;
while(Tmp != Head)
{
tmp = tmp->Next;
i++;
if (i == 1 || i == 2) result = Head->Next;
else if ( i%2 == 1) result = result->Next;
}
return result;
}