摘要: voie sort(LinkList &L) { LNode *p = L->next; LNode *pre; LNode *r = p ->next; p->next =NULL; p = r; while(p!=NULL){ r = p->next; pre = L; while(pre->n 阅读全文
posted @ 2022-09-27 20:30 昊昊昊田 阅读(39) 评论(0) 推荐(0)