摘要：1. 代码段1：单链表逆置 1.1 代码1 LNode Inverse(LNode L) //1 { //2 LNode p, q; //3 p = L next; //4 L next = NULL; //5 while (p != NULL) //6 { //7 q = p; //8 p = p 阅读全文