数据结构：单链表

最新推荐文章于 2024-09-09 15:48:17 发布

离雨眠

最新推荐文章于 2024-09-09 15:48:17 发布

阅读量741

点赞数

文章标签：数据结构链表 list

本文链接：https://blog.csdn.net/m0_70135336/article/details/124502923

版权

1.定义结构体链表

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

2.创建头节点

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

3.打印


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

4.尾插法插入元素

void appendElement(NodePtr paraHeader, char paraChar) {
	NodePtr p, q;
 
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next = NULL;
 
	p = paraHeader;
	while (p->next != NULL) {
		p = p->next;
	}
 	p->next = q;
 
}

5.插入元素


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

    p = paraHeader;
    for (int i = 0; i < paraPosition; i++) {
        p = p->next;
        if (p == NULL) {
            printf("此位置：%d 在链表中不存在", paraPosition);
            return ;
        }
    }

    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;


    printf("linking\r\n");
    q->next = p->next;
    p->next = q;
}

6.删除

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("无法找到所需要删除的数据%c\r\n", paraChar);
		return;
	}
	q = p->next;
	p->next = p->next->next;
	free(q);
}

全部代码


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


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

LinkList initLinkList() {
    NodePtr tempHeader = (NodePtr)calloc(1, sizeof(LNode));
    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;

    //1.创造一个新的节点并把paraChar赋给该节点
    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;
    q->next = NULL;

    p = paraHeader;
    while (p->next != NULL) {
        p = p->next;
    }

    p->next = q;
}


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

    p = paraHeader;
    for (int i = 0; i < paraPosition; i++) {
        p = p->next;
        if (p == NULL) {
            printf("此位置：%d 在链表中不存在", paraPosition);
            return ;
        }
    }

    q = (NodePtr)malloc(sizeof(LNode));
    q->data = paraChar;

    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("该元素不存在\r\n");
        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);

    deleteElement(tempList, 'e');
    deleteElement(tempList, 'a');
    deleteElement(tempList, 'H');
    printList(tempList);

    insertElement(tempList, 'o', 1);
    insertElement(tempList, 'a', 0);
    printList(tempList);
}

void basicAddressTest() {
    LNode tempNode1, tempNode2;

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

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

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

    tempNode1.next = &tempNode2;
}

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