链表的模块化实现

思维导图

---

头文件中

SList.h

#pragma once
#include<stdio.h>
#include<stdlib.h>
#include<assert.h>

typedef int SLTDataType;

typedef struct SListNode
{
    SLTDataType data;
    struct SListNode* next;
}SLTNode;

void SLTPrint(SLTNode*phead);
void SLTPushBack(SLTNode** pphead, SLTDataType x);
void SLTPushFront(SLTNode** pphead, SLTDataType x);
void SLTPopFront(SLTNode** pphead);
void SLTPopBack(SLTNode** pphead);

---

源文件中

SList.c

#include "SList.h"
void SLTPrint(SLTNode*phead)
{
    SLTNode* cur = phead;
    while (cur != NULL)
    {
        printf("%d->", cur->data);
        cur = cur->next;
    }
    printf("NULL\n");
}

SLTNode* BuySLTNode(SLTDataType x)
{
    SLTNode* newnode = (SLTNode*)malloc(sizeof(SLTNode));
    if (newnode == NULL)
    {
        perror("malloc fail");
        return NULL;
    }
    newnode->data = x;
    newnode->next = NULL;
    return newnode;
}


void SLTPushBack(SLTNode** pphead, SLTDataType x)//不为空的链表的尾插的本质：原尾结点中要存储新尾结点的地址
{
    SLTNode* newnode = BuySLTNode(x);
    if (*pphead == NULL)
    {
        *pphead = newnode;//把newnode的地址给phead
    }
    else
    {
        //找尾
        SLTNode* tail = *pphead;
        while(tail->next!=NULL)
        {
            tail = tail->next;
        }
        tail->next = newnode;//注意是tail->next不是tail，否则tail是局部变量，出了作用域就销毁，无法与newnode建立联系
    }
}

void SLTPushFront(SLTNode** pphead, SLTDataType x)
{
    SLTNode* newnode = BuySLTNode(x);
    newnode->next = *pphead;
    *pphead = newnode;

}

void SLTPopBack(SLTNode** pphead)
{
    //暴力检查
    assert(*pphead);
    //温柔的检查
    //if(*pphead==NULL)
    // return;
    //1、只有一个节点
    //2、多个节点
    if ((*pphead)->next == NULL)
    {
        free(*pphead);
        *pphead = NULL;
    }
    //找尾
    else
    {
        SLTNode* prev = NULL;
        SLTNode* tail = *pphead;
        while (tail->next != NULL)
        {
            prev = tail;
            tail = tail->next;
        }
        free(tail);
        tail = NULL;
        prev->next = NULL;
    }
}

void SLTPopFront(SLTNode** pphead)
{
    //暴力检查
    assert(*pphead);
    //温柔的检查
    //if(*pphead==NULL)
    // return;
    SLTNode* first = *pphead;
    *pphead = first->next;
    free(first);
    first = NULL;
}

Test.c

#include"SList.h"
void TestSList1()
{
    SLTNode* plist = NULL;
    SLTPushBack(&plist, 1);//需要改变形参，传二级指针
    SLTPushBack(&plist, 2);
    SLTPushBack(&plist, 3);
    SLTPushBack(&plist, 4);
    SLTPrint(plist);//不需要改变形参，传一级指针即可
}

void TestSList2()
{
    SLTNode* plist = NULL;
    SLTPushFront(&plist, 1);//需要改变形参，传二级指针
    SLTPushFront(&plist, 2);
    SLTPushFront(&plist, 3);
    SLTPushFront(&plist, 4);
    SLTPrint(plist);//不需要改变形参，传一级指针即可
    SLTPopBack(&plist);
    SLTPrint(plist);
    SLTPopBack(&plist);
    SLTPrint(plist);
    SLTPopBack(&plist);
    SLTPrint(plist);
}

void TestSList3()
{
    SLTNode* plist = NULL;
    SLTPushBack(&plist, 1);//需要改变形参，传二级指针
    SLTPushBack(&plist, 2);
    SLTPushBack(&plist, 3);
    SLTPushBack(&plist, 4);
    SLTPrint(plist);
    SLTPopFront(&plist);
    SLTPrint(plist);
    SLTPopFront(&plist);
    SLTPrint(plist);
    SLTPopFront(&plist);
    SLTPrint(plist);
    SLTPopFront(&plist);
    SLTPrint(plist);
}


int main()
{
    TestSList3();
    return 0;
}

---

运行结果