数据结构（一）单链表基本操作---增删查改排

单链表
本次复习单链表，融合了链表的一些基本操作：头插，尾插，删除，修改，排序

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

typedef struct Node
{
    int data;            //数据域
    struct Node* next;   //指针域
}link;

//初始化
link * creatLink(link* pHeader)
{
    pHeader = (link *)malloc(sizeof(link));
    pHeader->data = 0;
    pHeader->next = NULL;
    return pHeader;
}
//尾插
void insertTail(link *pHeader, int x)
{
    link *pNew = NULL;
    link *p = pHeader;
    while(p->next != NULL)
    {
        p = p->next;
    }
    pNew = (link *)malloc(sizeof(struct Node));
    pNew->next = p->next;//先断后再连前
    p->next = pNew;
    pNew->data = x;
}
//头插
void insertHead(link *pHeader, int x)
{
    link *pNew = (link *)malloc(sizeof(struct Node));
    link *p = pHeader->next;//先断后再连前
    pNew->next = pHeader->next;
    pNew->data = x;
    pHeader->next = pNew;
}
//删除指定数据
void deleteNode(link *pHeader, int x)
{
    link *p = pHeader->next;
    link *pR = pHeader;
    int flag = 0;
    if(p == NULL)
    {
        printf("链表为空\n");
        return;
    }
    while(p != NULL)
    {   
        if(p->data == x)
        {   
            flag = 1;
            pR->next = p->next;
            //打印p-next地址
            /*printf("p->next :%p\n",p->next);//是一样的
            printf("pR->next :%p\n",p->next);*/
            free(p);
            p = pR->next;//！！
            continue;
        }
        pR = p;
        p = p->next;
    }
    if(flag == 0)
    {
        printf("没有该值\n");
    }
    else
    {
        printf("删除成功\n");
    }
}
//遍历
void display(link *pHeader)
{
    link *p = pHeader->next;
    if(p == NULL)
    {
        printf("链表为空\n");
        return; 
    }
    while(p != NULL)
    {
        printf("%d\t",p->data);
        p = p->next;        
    }
    printf("\n");
}
//查找
void searchX(link *pHeader,int x)
{
    link *p = pHeader->next;
    int flag = 0;
    int num = 0;
    if(p == NULL)
    {
        printf("链表为空");
        return;
    }
    while(p != NULL)
    {
        num++;
        if(p->data == x)
        {
            flag = 1;
            printf("%d在第%d位\n",x,num);
        }
        p = p->next;        
    }
    if(flag == 0)
    {
        printf("没有该值\n");
    }
}
//改 将n改为x
void update(link *pHeader,int n,int x)
{
    link *p = pHeader->next;
    int flag = 0;
    if(p == NULL)
    {
        printf("链表为空\n");
        return;
    }
    while(p != NULL)
    {
        if(p->data == n)
        {
            flag = 1;
            p->data = x;        
        }
        p = p->next;        
    }
    if(flag == 0)
    {
        printf("没有该值\n");
    }
    else
    {
        printf("修改成功\n");
    }
}
//排序
void sort(link *pHeader)
{
    link* pR = pHeader;
    link* p = pR->next;
    link* pTail = NULL;
    while (pHeader->next->next != pTail)
    {
        pR = pHeader;
        p = pHeader->next;
        while (p->next != pTail)//冒泡排序
        {
            if (p->data > p->next->data)
            {
                //交换
                pR->next = p->next;
                p->next = p->next->next;
                pR->next->next = p;
                p = pR->next;
            }
            p = p->next;
            pR = pR->next;
        }
        pTail = p;
    }
}

int main()
{
    link *pHeader = creatLink(pHeader);//创建
    int _case = 0;
    while(1)
    {
        printf("1,头插\t2,尾插\t3,遍历\n4,删除\t5,查找\t6,修改\n");
        printf("输入操作: ");
        scanf("%d",&_case);
        switch(_case)
        {
            case 1:
            {
                int x = 0;
                printf("输入-1结束输入:");
                scanf("%d",&x);
                while(x != -1)
                {
                    insertHead(pHeader,x);
                    scanf("%d",&x);
                }
            }
            break;          
            case 2:
            {
                int x = 0;
                printf("输入-1结束输入:");
                scanf("%d",&x);
                while(x != -1)
                {
                    insertTail(pHeader,x);
                    scanf("%d",&x);
                }
            }
            break;
            case 3:
            {
                display(pHeader);
            }
            break;
            case 4:
            {
                display(pHeader);
                int x = 0;
                printf("请输入要删除的数据：");
                scanf("%d",&x);
                deleteNode(pHeader,x);
            }
            break;
            case 5:
            {
                int x = 0;
                printf("请输入要查找的数据：");
                scanf("%d",&x);
                searchX(pHeader,x);
            }
            break;
            case 6:
            {
                int x = 0;
                int n = 0;
                printf("请输入要修改的数据：");
                scanf("%d",&n);
                printf("请输入要修改为的数据：");
                scanf("%d",&x);
                update(pHeader,n,x);
            }
            break;
            case 7:
            {
                sort(pHeader);
            }break;
            case 8:printf("byebye!\n");return 0;
            default:printf("输入有误\n");
        }
    }

    return 0;
}