2.2单链表作业

1.代码 

#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;
 }// 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
	t 
	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

2.运行结果

3.心得体会

1.刚开始想不通链表操作原理的时候动手画画图，很快
就可以理解指针到底在节点之前怎么发挥他的作用。
2.如果要对链表进行修改(比如插入，删除等等）那么
在传值的时候要在结构指针的基础上再加一个指针，类
似于这样 creat _List(LinkList **head），其中，
LinkList为结构体声明， LinkList* 即为结构指针也就
是节点，那么 LinkList ** 就是节点的地址（这里如果
改成 LinkList 就会报错）；如果只是将链表调出
来，不进行任何操作 （例如打印元素，查找某个元素等
等），这种情况下只需要将节点 （一个结构指针）传给
函数即可 void print (LinkList xhead)。
3.在删除节点等需要考虑首元素的时候就不能直接将第
- 个有数据的节点交给临时节点应该进行的操作是将头
结点赋值给临时节点，然后开始遍历整个链表，直到找
到合适的值为止；如果进行链表中数据的比较，或者递
增排列等不需要考虑第一个数据节点位置的问题的时
候，可以将第一个数据节点（即头结点的指针域head＞next）交给临时变量。