面试题5：实现单链表的逆置

node *reverse(node *head)// 单链表的逆置{printf("\n单链表的逆置\n");if(head == NULL || head->next == NULL)return head;node *p1, *p2, *p3;p1 = head; p2 = p1->next;while(p2){p3 = p2->next;p2->next = p1;p1 = p2;p2 = p3;}head->next = NULL;head = p1;return head;}