单链表逆转

void inverseLinkList(List &head) { if (head == NULL || head->next == NULL) { return; } List p = head->next; List q = head; head->next = NULL; while(p) { List t = p->next; p->next = q; q = p; p = t; } head = q; }