数据结构之链表

// p24_list.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
// Date: 2024.1.18 22:05; 

#include <stdio.h>
#include <malloc.h>
#include <stdlib.h>
typedef struct Node 
{
    int data;//数据域
    struct Node* pNext;//指针域
}NODE,*PNODE;//NODE等价于struct Node，PNODE 等价于 struct Node *
//函数声明
PNODE create_list();
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;//等价于struct Node * pHead  = NULL;
    pHead = create_list();//创建一个非循环单链表，并将该链表的头节点的地址赋给pHead;
    traverse_list(pHead);
    insert_list(pHead, 4, 44);
   /* int len = length_list(pHead);
    printf("链表的长度是%d\n", len);
    
    sort_list(pHead);*/
    traverse_list(pHead);
    /*if (is_empty(pHead))
        printf("链表为空\n");
    else
        printf("链表不为空\n");*/
    
    return 0;
}

PNODE create_list()
{
    int len;//用来存放有效节点的个数
    int val;//用来临时存放用户输入的节点的值
    //分配了一个不存放有效数据的头结点pHead头指针指向分配的头节点
    PNODE pHead = (PNODE)malloc(sizeof(PNODE));
    if (pHead == NULL)
    {
        printf("分配失败，程序终止！\n");
        exit(-1);
    }
    PNODE pTail = pHead;
    pHead->pNext = NULL;


    printf("请输入您需要生成的链表节点的个数:len = ");
    scanf_s("%d", &len);
    for (int i = 0; i < len; ++i)
    {
        printf("请输入第%d个节点的值:", i + 1);
        scanf_s("%d", &val);
        PNODE pNew = (PNODE)malloc(sizeof(PNODE));
        if (NULL == pNew)
        {
            printf("分配失败，程序终止！\n");
            exit(-1);
        }
        //重点理解下面这些语句
        pNew->data = val;
        pTail->pNext = pNew;
        pNew->pNext = NULL;
        pTail = pNew;
    }
    return pHead;//p24:23：52
}
void traverse_list(PNODE pHead)
{
    //**a[i] == *(a+i)两者是等价的
    PNODE p = pHead->pNext;
    while (NULL != p)
    {
        printf("%d, ", p->data);
        p = p->pNext;
    }
    printf("\n");
    return;

}
bool is_empty(PNODE pHead)
{
    if (pHead->pNext == NULL)
    {
        return true;
    }
    else
    {
        return false;
    }
}
int length_list(PNODE pHead)
{
    PNODE p = pHead->pNext;
    int len = 0;
    while (NULL != p)
    {
        ++len;
        p = p->pNext;
    }
    return len;
}
void sort_list(PNODE pHead)
{
    int i=0, j=0,t = 0;
    int len = length_list(pHead);
    PNODE p,q;
    for (i = 0,p = pHead->pNext; i < len - 1; ++i,p = p->pNext)
    {
        for (j = i + 1,q = p->pNext; j < len; ++j,q = q->pNext)
        {
            if (p->data > q->data)
            {
                t = p->data;
                p->data = q->data;
                q->data = t;
            }

        }
    }
    return;
}
//在pHead所指向链表的第pos个节点的前面插入一个新的结点，该结点的值是val,并且pos的位置是从1开始
bool insert_list(PNODE pHead, int pos, int val)
{
    int i = 0;
    PNODE p = pHead;
    while (NULL != p && i < pos - 1)
    {
        p = p->pNext;
        ++i;
    }
    if (i > pos - 1 || NULL == p)
        return false;
    PNODE pNew = (PNODE)malloc(sizeof(NODE));
    if (NULL == pNew)
    {
        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 (NULL != p->pNext && i < pos - 1)
    {
        p = p->pNext;
        ++i;
    }
    if (i > pos - 1 || NULL == p->pNext)
        return false;
    PNODE q = p->pNext;
    *pVal = q->data;
    //删除p节点后面的结点
    p->pNext = p->pNext->pNext;
    free(q);
    q = NULL;

}