单链表笔记

单链表：一种链式存取的数据结构，用一组地址任意的存储单元存放线性表中的数据元素。

特点：

1.不要求逻辑上相邻的两个元素在物理位置上也相邻，不需要连续的存储空间。

2.是非随机的存储结构，查找某个特定节点时需依次查找。

优缺点：

1.优点：可按照实际所需创建节点增减链表长度。

2.缺点：进行尾部或任意位置上插入或删除时时间复杂度和空间复杂度较大，相对顺序表查找效率较低。

单链表代码：

#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 printfList

/*
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. Consturct 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 form 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 deletdElement

/*
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

执行结果：

 单链表上的操作：

1.定义存储表示

分为两部分：数据域与指针域

节点既要存储数据元素，又要表示节点间的关系

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

 2.建立

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

3.遍历

声明一个指针，从头结点指向的第一个结点开始若指针不为空则输出当前结点并指向下个结点

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

4.添加

建立一个新链表，找到原链表头结点并遍历至尾结点，使尾结点指向新链表头结点

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;
}

5.插入

从表结点遍历，查找第i-1个结点即插入位置的前驱结点p，令新结点的指针域指向p的后继结点，然后使p的指针域指向新结点

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. Consturct 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;
}

6.删除

从表结点遍历，查找第i-1个结点即删除位置的前驱结点p，被删除结点为q，使p的指针域指向q的下一个结点，然后释放结点q的存储空间

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);
}

测试部分：

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);
}

地址分配：

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;
}