单链表(不妨带头节点)就地逆置的高效算法: linklist *ReverseLklist(linklist *L) { linklist *p = L->next; linklist *q = NULL; linklist *h = NULL; while (p != NULL) { q = p->next; p->next = h; h = p; p = q; } L->next = h; return L; }