c语言数据结构之顺序表单循环链表的创建及功能函数

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>

typedef struct CLinkList
{
    int data;
    struct CLinkList *next;
}node;

void ds_init(node **pNode);             //初始化循环链表
void ds_insert(node **pNode, int i);    //插入结点
void ds_delete(node **pNode, int i);    //删除结点
void ds_traverse(node *pNode);          //遍历
int  ds_search(node *pNode, int elem);  //返回结点所在的位置
void ds_deleteall(node **pNode);        //删除所有结点

int main(void)
{
    node *pHead = NULL;
    char opp = 0;
    int find;

    while( opp != '0')
    {
        printf("1.初始化链表\n2.插入结点\n3.删除结点\n\
4.遍历链表\n5.返回结点位置\n0.退出\n请选择你的操作:");
        fflush(stdin);      //清除缓冲区
        scanf("%c", &opp);
        switch( opp )
        {
        case '1':
            ds_deleteall(&pHead);
            ds_init(&pHead);
            printf("\n");
            ds_traverse(pHead);
            printf("\n");
            break;

        case '2':
            printf("输入需要插入结点的位置:");
            scanf("%d", &find);
            ds_insert(&pHead, find);
            printf("在位置%d插入值后:\n", find);
            ds_traverse(pHead);
            printf("\n");
            break;

        case '3':
            printf("输入需要删除结点的位置:");
            scanf("%d", &find);
            ds_delete(&pHead, find);
            printf("删除第%d个结点后:\n", find);
            ds_traverse(pHead);
            printf("\n");
            break;

        case '4':
            ds_traverse(pHead);
            printf("\n");
            break;

        case '5':
            printf("你要查找的结点的值:");
            scanf("%d", &find);
            ds_traverse(pHead);
            printf("元素%d所在位置:%d\n", find, ds_search(pHead, find) );
            printf("\n");
            break;

        case '0':
            exit(0);
        }
    }

    getch();
    return 0;
}

void ds_init(node **pNode)  //初始化循环链表
{
    int count = 1;
    int item;
    node *temp;
    node *target;
    printf("输入结点的值,输入0完成初始化\n");
    while( 1 ) 
    {
        printf("第%d项:", count ++);
        scanf("%d", &item);
        fflush(stdin);      //清除缓冲区

        if(item == 0)
            return;

        if( (*pNode) == NULL )  //只有一个结点
        {
            *pNode = (node *)malloc( sizeof(struct CLinkList) );
            if( !(*pNode) )
                exit(0);
            (*pNode)->data = item;
            (*pNode)->next = *pNode;
        }
        else
        {
            //找到最后一个结点
            for(target = (*pNode); target->next != (*pNode);target = target->next);

            temp = (node  *)malloc( sizeof(struct CLinkList) );
            if( !temp )
                exit(0);
            temp->data = item;
            temp->next = *pNode;
            target->next = temp;
        }
    }
}

void ds_insert(node **pNode, int i) //插入结点
{
    node *temp;
    node *target;
    int item;
    int j = 1;
    printf("输入要插入结点的值:");
    scanf("%d", &item);
    temp = (node *)malloc( sizeof(struct CLinkList) );
    if( !temp )
        exit(0);

    if(i == 1)
    {
        temp->data = item;
        temp->next = (*pNode);
        for(target = (*pNode);target->next != (*pNode);target = target->next);
        target->next = temp;
        *pNode = temp;
    }
    else
    {
        target = *pNode;
        for( ;j < i-1;j ++)
            target = target->next;
        temp->data =item;
        temp->next = target->next;
        target->next = temp;
    }
}

void ds_delete(node **pNode, int i) //删除结点
{
    node *target;
    node *temp;
    int j = 1;
    if(i == 1)
    {
        for(target = *pNode;target->next != *pNode;target = target->next);
        temp = *pNode;
        *pNode = (*pNode)->next;//!!!!
        target->next = *pNode;
        free(temp);
    }
    else
    {
        target = *pNode;
        for( ;j < i-1;j ++ )
            target = target->next;
        temp = target->next;
        target->next = temp->next;
        free(temp);
    }
}

void ds_traverse(node *pNode) //遍历
{
    node *temp;
    temp = pNode;
    printf("***********链表中的元素******************\n");
#if (0) 
    while(temp->next != pNode)
    {
        printf("%4d", temp->data);
        temp = temp->next;
    }
    printf("%4d", temp->data);
#endif
    do{
        printf("%d  ", temp->data);
    }while( (temp = temp->next) != pNode );
    printf("\n");
}

int ds_search(node *pNode, int elem) //返回结点所在的位置
{
    node *target;
    int i = 1;
    for(target = pNode;target->data != elem && target->next != pNode; ++i)
        target = target->next;
    if(target->next == pNode)
    {
        if(target->data != elem)
            return 0;
        else 
            return 1;
    }
    else
        return i;
}

void ds_deleteall(node **pNode)     //删除所有结点
{
    int count = 0, i;
    node *temp;
    node *target;
    if( (*pNode) == NULL )
        return ;
    for(target = *pNode; target->next != *pNode;target = target->next)
        count ++ ;
    for(i = 0;i < count;i++)
    {
        temp = *pNode;
        *pNode = (*pNode)->next;
        target->next = *pNode;
        free(temp);
    }
    free(target);
    *pNode = NULL;
}