2.2链表及心得收获

一、收获感想 

1.链表的概念：链表是一种物理存储结构上非连续、非顺序的存储结构，但链表在逻辑上是连续的，顺序的，而数据元素的逻辑顺序是通过链表中的指针连接次序实现的。

2.功能：

1、它是用于储存数据的一种结构

2、尾部插入数据，尾部删除数据，头部插入数据，头部删除数据，任意位置的插入，任意位置的删除，查找数据位置，修改数据的功能。（以上均为搜索所知）

3.单链表的结构

头指针和指针节点的区分：不管带不带头节点，头指针始终指向链表的第一个结点，而头结点是带头结点的链表中的第一个结点，结点内通常不储存信息。

3.感受：通过两次摘抄代码作业的练习，明显感受到自己的耐心和细心都在增加，这次查找bug的时间也大大缩减了，犯的错误也相较于第一次少了许多。希望未来的学习过程中能够继续保持，越来越细心有耐心，毕竟这是一个合格的程序员所应该具备的。

二、代码摘抄

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

/**
 * Linked list of characters.
 */
 typedef struct LinkNode{
    char data;
	struct LinkNode *next;
} LNode, *LinkList, *NodePtr;

/**
 * Imitialize 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;
 } // of initLinkList
 
 /**
  * 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;
	} // of while
	printf("\r\n");
}// of printList

/**
 * 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;
	}//of while
	
	// Step 3. Now add/link.
	p->next = q;
}// Of appendElement

/**
 * 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 the list.", paraPosition);
			return;
		}// of if
	} // of for i
	
	//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;
}// of insertElement

/**
 * Delete an element from the list.
 * @param paraHeader The header of the list.
 * @param paraChar The given char.
 */
void deleteElement(NodePtr paraHeader, char paraChar){
	NodePtr p, q;
	p = paraHeader;
	while ((p->next != NULL)&&(p->next->data != paraChar)){
		p = p->next; 
	}// of while
	
	if (p->next == NULL) {
		printf("Cannot delete %c\r\n",paraChar);
		return;
	}// of if
	
	q = p->next;
	p->next = p->next-> next;
	free(q);
}// of deleteElement

/**
 * 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);
}// of appendInsertDeleteTest

/**
 * Address test: beyond the book.
 */
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;
}// of basicAddressTest

/**
 * The entrance.
 */
 int main(){
 	appendInsertDeleteTest();
 }// of main

三、运行结果