通过C语言实现数据结构的循环链表

#include "text.h" void InitCLinkList(CLinkList* CL) { *CL = (CLinkList)malloc(sizeof(Node)); (*CL)->next = *CL; } void CreateFromTail(CLinkList CL) { Node* p, * s; char c; int flag = 1; p = CL; while (flag) { c = getchar(); if (c != '$') { s = (Node*)malloc(sizeof(Node)); s->data = c; p->next = s; p = s; } else { flag = 0; p->next = CL; } } } Node* Get(CLinkList CL, int i) { Node* p; int j = 0; p = CL->next; while (p != CL && j < i) { p = p->next; j++; } if (i == j)return j; else return NULL; } Node* Locate(CLinkList CL, ElemType key) { Node* p; p = CL->next; while (p != CL && p->data != key)p = p->next; if (p != CL)return p; else return NULL; } int InsCList(CLinkList CL, int i, ElemType e) { Node* pre,* s; int j = 0; pre = CL->next; while (pre != CL && j < i - 1) { pre = pre->next; j++; } if (j != i - 1) { printf("插入位置错误\n"); return -1; } s = (Node*)malloc(sizeof(Node)); s->data = e; s->next = pre->next; pre->next = s; return 0; } int DelCList(CLinkList CL, int i, ElemType* e) { Node* pre,* r; int j = 0; pre = CL->next; while (pre != CL && j < i - 1) { pre = pre->next; j++; } r = pre->next; *e = pre->data; pre->next = pre->next->next; free(r); return 0; } CLinkList merge_1(CLinkList A, CLinkList B) { Node* p, * q; p = A; q = B; while (p->next != A)p = p->next; while (q->next != B)q = q->next; q->next = A; p->next = B->next; free(B); return A; } CLinkList merge_2(CLinkList A, CLinkList B) { Node* p; p = A->next; A->next = B->next->next; free(B->next); B->next = p; return B; }