#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 = 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("The position %d is beyond the scope of the list.", 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("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);
//删除一些字母(第一次出现的)
deleteElement(tempList, 'e');
deleteElement(tempList, 'a');
deleteElement(tempList, 'o');
printList(tempList);
//插入到给定位置
insertElement(tempList, 'o', 1);
printList(tempList);
}
//地址测试
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;
}
int main() {
appendInsertDeleteTest();
}
运行结果