2:2单链表-CSDN博客

本文链接：https://blog.csdn.net/weixin_63065527/article/details/124463118

本文详细介绍了如何在C语言中使用链表数据结构，包括创建链表、初始化头节点、打印链表、添加元素（尾部插入）、删除指定元素以及在指定位置插入新节点的示例。通过附带的代码和图示，读者可以理解并实践这些基本的链表操作。

摘要由CSDN通过智能技术生成

一、代码块

创建线性表结构

typedef struct LinkNode{
    char data;
    struct LinkNode *next;
} LNode, *LinkList, *NodePtr;

创建头节点

LinkList initLinkList(){
    NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
    tempHeader->data = '\0';
    tempHeader->next = NULL;
    return tempHeader;
}

打印线性表

void printList(NodePtr paraHeader){
    NodePtr p = paraHeader->next;
    while (p != NULL){
        printf("%c", p->data);
        p = p->next;
    }
    printf("\r\n");
}

添加元素

void appendElement(NodePtr paraHeader, char paraChar){
    NodePtr p, q;

    //创建插入元素结点
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    q->next = NULL;

    //循环线性表，p最后指向线性表尾部结点
    p = paraHeader;
    while (p->next != NULL){
        p = p->next;
    }

    //向尾部添加新结点
    p->next = q;
}

删除指定元素结点

void deleteElement(NodePtr paraHeader, char paraChar){
    NodePtr p, q;
    p = paraHeader;
    while ((p->next != NULL) && (p->next->data != paraChar)){
        p = p->next;
    }

    //判断指定元素是否存在于线性表中
    if (p->next == NULL) {
        printf("Cannot delete %c\r\n", paraChar);
        return;
    }

    //删除指定元素结点，释放空间
    q = p->next;
    p->next = p->next->next;
    free(q);
}

向指定位置后插入新结点

void insertElement(NodePtr paraHeader, char paraChar, int paraPosition){
    NodePtr p, q;

    //循环链表，p指向指定结点
    p = paraHeader;
    for (int i = 0;i < paraPosition;i++){
        p = p->next;
        //判断插入位置前驱是否为空
        if (p == NULL){
            printf("The position %d is beyond the scope of the list.", paraPosition);
            return;
        }
    }

    //创建新结点
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    q->next = NULL;

    //将新结点插入线性表中
    printf("linking\r\n");
    q->next = p->next;
    p->next = q;
}

添加、插入、删除测试

void appendInsertDeleteTest(){
    
    //创建头结点
    LinkList tempList = initLinkList();
    printList(tempList);

    //添加元素结点测试
    appendElement(tempList, 'H');
    appendElement(tempList, 'e');
    appendElement(tempList, 'l');
    appendElement(tempList, 'l');
    appendElement(tempList, 'o');
    appendElement(tempList, '!');
    //打印线性表
    printList(tempList);//结果:'Hello!'

    //删除元素结点测试
    deleteElement(tempList, 'e');
    deleteElement(tempList, 'a');//'Cannot delete a'
    deleteElement(tempList, 'o');
    //打印线性表
    printList(tempList);//'Hll!'

    //插入元素结点测试
    insertElement(tempList, 'o', 1);
    //打印线性表
    printList(tempList);//'Holl!'
}

二、图示

void appendElement(NodePtr paraHeader, char paraChar)

appendElement(tempList, 'H');

appendElement(tempList, 'e');

appendElement(tempList, 'l');
appendElement(tempList, 'l');
appendElement(tempList, 'o');
appendElement(tempList, '!');

void deleteElement(NodePtr paraHeader, char paraChar)

deleteElement(tempList, 'e');

deleteElement(tempList, 'a');

p->next == NULL

输出'Cannot delete a'

deleteElement(tempList, 'o');

void insertElement(NodePtr paraHeader, char paraChar, int paraPosition)

insertElement(tempList, 'o', 1);

三、全部代码

//
//  main.c
//
//  Created on 2022/4/27.
//


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

//创建单链表结构
typedef struct LinkNode{
    char data;
    struct LinkNode *next;
} LNode, *LinkList, *NodePtr;

//创建头节点
LinkList initLinkList(){
    NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
    tempHeader->data = '\0';
    tempHeader->next = NULL;
    return tempHeader;
}

//打印单链表
void printList(NodePtr paraHeader){
    NodePtr p = paraHeader->next;
    while (p != NULL){
        printf("%c", p->data);
        p = p->next;
    }
    printf("\r\n");
}

//添加元素
void appendElement(NodePtr paraHeader, char paraChar){
    NodePtr p, q;

    //创建插入元素结点
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    q->next = NULL;

    //循环链表，p最后指向单链表尾部结点
    p = paraHeader;
    while (p->next != NULL){
        p = p->next;
    }

    //向尾部添加新结点
    p->next = q;
}

//向指定位置后插入新结点
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition){
    NodePtr p, q;

    //循环链表，p指向指定结点
    p = paraHeader;
    for (int i = 0;i < paraPosition;i++){
        p = p->next;
        //判断插入位置前驱是否为空
        if (p == NULL){
            printf("The position %d is beyond the scope of the list.", paraPosition);
            return;
        }
    }

    //创建新结点
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    q->next = NULL;

    //将新结点插入链表中
    printf("linking\r\n");
    q->next = p->next;
    p->next = q;
}

//删除指定元素结点
void deleteElement(NodePtr paraHeader, char paraChar){
    NodePtr p, q;
    p = paraHeader;
    while ((p->next != NULL) && (p->next->data != paraChar)){
        p = p->next;
    }

    //判断指定元素是否存在于链表中
    if (p->next == NULL) {
        printf("Cannot delete %c\r\n", paraChar);
        return;
    }

    //删除指定元素结点，释放空间
    q = p->next;
    p->next = p->next->next;
    free(q);
}

//添加、插入、删除测试
void appendInsertDeleteTest(){
    
    //创建头结点
    LinkList tempList = initLinkList();
    printList(tempList);

    //添加元素结点测试
    appendElement(tempList, 'H');
    appendElement(tempList, 'e');
    appendElement(tempList, 'l');
    appendElement(tempList, 'l');
    appendElement(tempList, 'o');
    appendElement(tempList, '!');
    //打印线性表
    printList(tempList);//结果:'Hello!'

    //删除元素结点测试
    deleteElement(tempList, 'e');
    deleteElement(tempList, 'a');//'Cannot delete a'
    deleteElement(tempList, 'o');
    //打印线性表
    printList(tempList);//'Hll!'

    //插入元素结点测试
    insertElement(tempList, 'o', 1);
    //打印单链表
    printList(tempList);//'Holl!'
}

//观察地址分配
void basicAddressTest(){
    LNode tempNode1, tempNode2;

    tempNode1.data = 4;
    tempNode1.next = NULL;

    tempNode2.data = 6;
    tempNode2.next = NULL;

    printf("The first node: %d, %d, %d\r\n",
        &tempNode1, &tempNode1.data, &tempNode1.next);
    printf("The second node: %d, %d, %d\r\n",
        &tempNode2, &tempNode2.data, &tempNode2.next);

    tempNode1.next = &tempNode2;
}

//main
int main(){
    appendInsertDeleteTest();
}