不使用第三个结点实现单链表的逆转

struct Node{int data;Node *next;};Node *Reverse(Node *head){Node h = head, p = head->next, n = NULL;h->next = NULL;while(p->next != NULL){n = p->next;p->next = h;h = p;p = n;}p->next = h;return p;}