数据结构与算法学习：2.单链表

1.链表

1.1、链表的概念

链表是一种物理存储单元上非连续、非顺序的存储结构，数据元素的逻辑顺序是通过链表中的指针链接次序实现的。
链表由一系列结点（链表中的每一个元素称为结点）组成，结点可以在运行时动态生成。

1.2、为什么要创建链表

与之前学习的顺序表相比较，顺序表存在两个比较明显的缺陷，一是在顺序表中动态增容会存在一定的性能消耗，二是顺序表需要在头部插入数据以及挪动数据，当你的数据很大的时候，你就需要移动大量的元素，造成难以确定存储空间的容量问题，因此这个时候就有了链表的引入

2.链表的构成

2.1、创建链表

typedef struct LinkNode{
	char data;
	struct LinkNode *next;
} LNode, *LinkList, *NodePtr;

2.2、链表的初始化

LinkList initLinkList(){
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	return tempHeader;
}

2.3、打印链表

void printList(NodePtr paraHeader){
	NodePtr p = paraHeader->next;
	while(p != NULL){
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");

2.4、元素的插入

插入一：头插法

void headElement(NodePtr paraHeader, char paraChar){
	NodePtr p,q;
	
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	
	p = paraHeader;
	q->next = p->next;
	p->next = q;	
}

插入二：尾插法

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

插入三：根据指定位置进行插入

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. Costruct a new code.
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	
	// Step 3. Now link.
	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}

2.5、指定元素的删除

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

2.6、链表的反转

LNode* reverseTable(LNode* head)
{
	if(head == NULL || head->next == NULL){
		return head;//如果是空链或者只有一个结点，则直接返回头文件 
	}
	else{
		LNode* new_head = reverseTable(head->next);//递归，直到找到最后一个结点 
		head -> next ->next = head;
		head -> next = NULL;
		return new_head;
	}
	 
}

3.总代码

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

/**
 * Linked list of character. 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
LNode* reverseTable(LNode* head)
{
	if(head == NULL || head->next == NULL){
		return head;//如果是空链或者只有一个结点，则直接返回头文件 
	}
	else{
		LNode* new_head = reverseTable(head->next);//递归，直到找到最后一个结点 
		head -> next ->next = head;
		head -> next = NULL;
		return new_head;
	}
	 
}

void headElement(NodePtr paraHeader, char paraChar){
	NodePtr p,q;
	
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	
	p = paraHeader;
	q->next = p->next;
	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 the list.",paraPosition);
			return;
		}// Of if
	}// Of for i
	
	// Step 2. Costruct a new code.
	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 fron 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);
	printf("在头部插入一个字母A\n");
	headElement(tempList,'A');
	printList(tempList);
	printf("把刚刚插入的字母删除\n");
	deleteElement(tempList,'A');
	printList(tempList);
	printf("再将单链表反转输出\n");
	tempList = reverseTable(tempList);
	printList(tempList);
	printf("反转回来\n");
	tempList = reverseTable(tempList);
	printList(tempList);
	
	// Step 3. Delete some characters.
	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();
}

4.总结

通过对此次单链表代码的编写，我发现了一些非常明显的问题，虽然单链表相较于顺序表来说有着一定的优点，但是它的缺点也十分明显。
那就是当你想要访问一个特定元素的时候，它必须要从表头开始一个一个地遍历，这就导致了有时候访问元素的效率非常低。而这个问题也是我们需要通过思考来进行解决的，对此我也进行了一定的搜寻，如果感兴趣可以去看看这篇文章跳表的使用