不带头结点的循环链表建立、输出、删除

建立

//不带头结点的循环链表
LinkList* initCList(){
    LinkList* rear;
    LinkList* list;
    list = (LinkList*)malloc(sizeof(LinkList));
    list->next = NULL;
    rear = list;
    for(int i=0;i<10;i++){
        LinkList *s = (LinkList*)malloc(sizeof(LinkList));
        s->data = i;
        rear->next = s;
        rear = s;
    }
    rear->next = list->next;//不赋值尾NULL，将会不断输出
    return list->next;
}

输出

void printCList(LinkList* L){
    LinkList* p = L;
    while(L->next!=p){
        cout<<L->data<<" ";
        L = L->next;
    }
    cout<<L->data;
    cout<<endl;
}

删除

LinkList* deleteNode(LinkList *s){
    LinkList* q = s;
    while(q->next->next != s)
        q = q->next;
    LinkList* temp = q->next;
    q->next = s;
    free(temp);
    return s;
}