typedef struct _Node
{
int data;
struct _Node *next;
} Node;
Node* Opposite(Node *head)
{
if(head == NULL)
return NULL;
Node *before,*middle,*after;
before = NULL;
middle = head;
while(middle != NULL)
{
after = middle->next;
middle->next = before;
before = middle;
middle = after;
}
return before;
}
单向链表反转
最新推荐文章于 2022-09-13 13:32:48 发布