Node * k = head;
if(k == NULL)
{
return NULL;
}
link *g;
g = k;
if ( k->next )
{
k = k->next;
}
g->next = NULL;
while( k != NULL)
{
link *f = k->next;
k->next = h;
h = p;
p = t;
}
return h;
面试系列之一:C艹翻转单向链表
最新推荐文章于 2024-07-25 18:43:45 发布