数据结构代码第二次摘抄

单链表的定义

 由于顺序表的插入删除操作需要移动大量的元素，影响了运行效率，因此引入了线性表的链式存储——单链表。单链表通过一组任意的存储单元来存储线性表中的数据元素，不需要使用地址连续的存储单元，因此它不要求在逻辑上相邻的两个元素在物理位置上也相邻。

单链表的特点：单链表不要求逻辑上相邻的两个元素在物理位置上也相邻，因此不需要连续的存储空间。

单链表是非随机的存储结构，即不能直接找到表中某个特定的结点。查找某个特定的结点时，需要从表头开始遍历，依次查找。

对于每个链表结点，除了存放元素自身的信息外，还需要存放一个指向其后继的指针。

代码摘抄如下：

#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 pointerto 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. 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 first node: %d, %d, %d\r\n", &tempNode2, &tempNode2.data, &tempNode2.next);
	
	tempNode1.next = &tempNode2;
}// Of basicAddressTest

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

运行结果如下

Hello!
Cannot delete a
Hll!
linking
Holl!

--------------------------------
Process exited after 0.01479 seconds with return value 0
请按任意键继续. . .

这是我数据结构代码的第二次摘抄，感觉速度和准确率有很大的提高，但是理解代码内容对我还是有一定的难度，可能是上学期结构体和指针学得不是很好，所以说下一步应该重新认真学习一下旧知识，毕竟感觉基础还是很重要。