链表的基本操作

链表的增、删、改、查。

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

typedef struct Node{
     int data;//数据域
     struct Node *pNext;//指针域
}Node,*PNode;

PNode Create_list(void);
void Traverse_list(PNode pHead);
bool is_empty(PNode pHead);
int length_list(PNode);
bool insert_list(PNode,int,int);
bool delete_list(PNode,int,int *);
void sort_list(PNode);

int main()
{
    PNode pHead = NULL;
    pHead = Create_list();//插件一个非循环单链表，并将该链表的头结点赋给Phead
    Traverse_list(pHead);
    int val;
 /*   if(is_empty(pHead)){
        printf("链表为空！\n");
    }else{
        printf("链表不空！\n");
    }
 */
    //sort_list(pHead);

    //int len = length_list(pHead);
    //printf("链表的长度是:%d\n",len);
    //insert_list(pHead,4,33);
    if(delete_list(pHead,4,&val)){
         printf("删除成功，您删除的元素是：%d\n ",val);
    }else{
         printf("删除失败！您删除的元素不存在\n");
    }
    Traverse_list(pHead);
    return 0;
}
//创建
PNode Create_list(){
    int len;
    int i;

    PNode pHead = (PNode)malloc(sizeof(Node));
    if(pHead==NULL){
        printf("分配失败，程序终止！\n");
        exit(-1);
    }
    PNode pTail = pHead;
    pTail->pNext = NULL;

    printf("请输入您需要生成链表结点的个数：len = ");
    scanf("%d",&len);
    for(i=0;i<len;i++){
        printf("请输入第%d个节点的值:",i+1);
        int val;
        scanf("%d",&val);

        PNode PNew = (PNode)malloc(sizeof(Node));
        if(PNew == NULL){
            printf("分配失败，程序终止！\n");
            exit(-1);
        }
        PNew->data = val;
        //PHead->PNext = PNew;
        //PNew->PNext = NULL;
        pTail->pNext = PNew;
        PNew->pNext = NULL;
        pTail = PNew;
    }
    return pHead;
}
//遍历
void Traverse_list(PNode pHead){
       PNode p = pHead->pNext;
       while(p != NULL){
          printf("%d ",p->data);
          p = p->pNext;
       }
       printf("\n");
 }
//判空
bool is_empty(PNode pHead){
      if(pHead->pNext==NULL){
           return true;
      }
      return false;
}
//长度
int length_list(PNode pHead){
      PNode p = pHead->pNext;
      int cnt = 0;
      if(p != NULL){
         cnt++;
         p = p->pNext;
      }
      return cnt;
}
//排序
void sort_list(PNode pHead){

    int i,j,t;
    PNode p,q;
    int len = length_list(pHead);
    for(p=pHead->pNext,i=0;i<len-1;p=p->pNext,++i){
        for(q=p->pNext,j=i+1;j<len;q=q->pNext,++j){
            if((p->data) > (q->data)){//一开始不懂，就先写懂的，然后再一个个转换过来
                t = p->data;//t=a[i];
                p->data = q->data;//a[i]=a[j];
                q->data = t;//a[j]=t;
            }
        }
    }
    return;
}
//插入 在pHead所指向链表的第pos个节点的前面插入一个新的节点，值为val  pos的值从1开始
bool insert_list(PNode pHead,int pos,int val){
    int i=0;
    PNode p = pHead;
    while(p!=NULL&&i<pos-1){
        p=p->pNext;
        ++i;
    }
    if(i>pos-1||p==NULL){
        return false;
    }
    PNode pNew = (PNode)malloc(sizeof(Node));
    if(pNew==NULL){
        printf("动态分配内存失败！\n");
        exit(-1);//这样的话就会整体退出内存
    }

    pNew->data = val;
    PNode q = p->pNext;
    p->pNext = pNew;
    pNew->pNext = q;

    return true;
}

bool delete_list(PNode pHead,int pos,int *pVal){
    int i=0;
    PNode p = pHead;
    while(p->pNext!=NULL&&i<pos-1){
        p=p->pNext;
        ++i;
    }

    if(i>pos-1||p->pNext==NULL){
        return false;
    }

    PNode q = p->pNext;
    *pVal = q->data;

    p->pNext = p->pNext->pNext;
    free(q);
    q = NULL;

    return true;
}