单链表实现Single Linked List

1.代码实现 

#include 
#include 
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;
	}// Of while
	printf("\r\n");
}
void printListMemory(NodePtr paraHeader){
	NodePtr p = paraHeader;
	while (p != NULL) {
		printf("At address %ld, data = %c, next = %ld \r\n", p, p->data, p->next);
		p = p->next;
	}// Of while
	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, '!');
	printf("After appendElement");
	printList(tempList);
	printListMemory(tempList);
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printf("After deleteElement");
	printList(tempList);
	printListMemory(tempList);
	insertElement(tempList, 'o', 1);
	printf("After insertElement");
	printList(tempList);
	printListMemory(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();
return 0;
}

2.运行结果

After appendElementHello!
At address 10097680, data = , next = 10119888
At address 10119888, data = H, next = 10119920
At address 10119920, data = e, next = 10119952
At address 10119952, data = l, next = 10119984
At address 10119984, data = l, next = 10120016
At address 10120016, data = o, next = 10120048
At address 10120048, data = !, next = 0

Cannot delete a
After deleteElementHll!
At address 10097680, data = , next = 10119888
At address 10119888, data = H, next = 10119952
At address 10119952, data = l, next = 10119984
At address 10119984, data = l, next = 10120048
At address 10120048, data = !, next = 0

linking
After insertElementHoll!
At address 10097680, data = , next = 10119888
At address 10119888, data = H, next = 10120016
At address 10120016, data = o, next = 10119952
At address 10119952, data = l, next = 10119984
At address 10119984, data = l, next = 10120048
At address 10120048, data = !, next = 0

3.心得体会

•  认知层面 ：单链表打破数组连续存储的思维定式，以指针构建链式结构。

• 实践层面 ：在实现单链表操作时通过反复调试纠错，我的代码逻辑和调试能力得到极大锻炼。

• 应用层面 ：单链表在插入删除上的高效性，让我明白依据场景选择数据结构的重要性