摘要：利用单链表，查找倒数第k个元素 int *searchk(LinkList L,int k) { LNode* p, * q;; p = L->next; q = L->next; int count = 0; while (p) { if (count < k) count++; else q = 阅读全文