在本次课程,老师抽查了我们的作业,让我们上去讲解单链表的代码并画出示意图,发现结果并不是很理想。于是老师又为我们细致讲了单链表各个部分的代码,同时画出了程序流程图,通俗易懂,加深同学们对单链表的认识理解。之后老师又抽人上去在复述一遍,可以发现这次讲解的效果好了很多。
在这一次上课之后我们能基本理解单链表,但是上次课程掌握的却不够,说明我对这些之时还掌握的不够牢固,需要花时间去巩固,去积累,去理解,在敲代码的同时也要在纸上画出流程图,帮助理解。这节课的学习让我受益匪浅。
代码:
#include <stdio.h> #include <malloc.h> /** *Linked list of characters.The key is data. */ typedef struct LinkNode{ char data; struct LinkNode *next; } LNode, *LinkList, *NodePtr; /** *Initialize the list with a header. *@return The pointer to the header. */ LinkList initLinkList(){ NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode)); tempHeader->data = '\0'; tempHeader->next = NULL; return tempHeader; } /** *Print the list. *@param paraHeader The header of the list. */ void printList(NodePtr paraHeader){ NodePtr p = paraHeader->next; while (p!= NULL) { printf("%c",p->data); p = p->next; } printf("\r\n"); } /** *Add an element to the tail. *@param paraHeader The header of the list. *@param paraChar The given char. */ void appendElement(NodePtr paraHeader, char paraChar){ NodePtr p,q; //Step 1.Construct a new node. q = (NodePtr)malloc(sizeof(LNode)); q->data = paraChar; q->next = NULL; //Step 2.Search to the tail. p = paraHeader; while (p->next !=NULL) { p = p->next; } //Step 3. Now add/link. p->next = q; } /** *Insert an element to the given position. *@param paraHeader The header of the list. *@param paraChar The given char. *param paraPosition The given position. */ void insertElement(NodePtr paraHeader, char paraChar, int paraPosition){ NodePtr p,q; //Step 1.Search to the position. p = paraHeader; for (int i = 0; i < paraPosition; i ++) { p = p->next; if (p==NULL) { printf("The position %d is beyond the scope of list.",paraPosition); return; } } //Step 2. Construct a new node. q = (NodePtr)malloc(sizeof(LNode)); q->data = paraChar; //Step 3. Now link. printf("linking\r\n"); q->next = p->next; p->next = q; } /** *Delete an element from the list. *@param paraHeader The header of the list. *@param paraChar he given char. */ 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); } /** *Unit test . */ void appendInsertDeleteTest(){ //Step 1. Initialize an empty list. LinkList tempList = initLinkList(); printList(tempList); //Step 2. Add some characters. appendElement(tempList,'H'); appendElement(tempList,'e'); appendElement(tempList,'l'); appendElement(tempList,'l'); appendElement(tempList,'o'); appendElement(tempList,'!'); printList(tempList); //Step 3. Delete some characters (the first occurrence). deleteElement(tempList,'e'); deleteElement(tempList,'a'); deleteElement(tempList,'o'); printList(tempList); //Step 4. Insert to a given position. insertElement(tempList,'o',1); printList(tempList); } /** *Address test: beyond the book. */ void basicAddressTest(){ LNode tempNode1,tempNode2; tempNode1.data= 4; tempNode1.next = NULL; tempNode2.data = 4; 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; } /** *The entrance. */ int main(){ appendInsertDeleteTest(); }
运行结果:
Hello! Cannot delete a Hll! linking Holl!