数据结构第二次作业(单链表)

代码如下

#include<iostream>
using namespace std;
typedef struct LinkNode {
	char data;
	struct LinkNode* next;
} LNode, * LinkList, * NodePtr;
//初始化表头
LinkList initLinkList() {
	NodePtr tempHeader = (NodePtr)malloc(sizeof(LNode));
	tempHeader->data = '\0';
	tempHeader->next = nullptr;
	return tempHeader;
}
//输出表数据
void printList(NodePtr paraHeader) {
	NodePtr p = paraHeader->next;
	while (p != nullptr) {
		cout << p->data;
		p = p->next;
	}
	puts("");
}
//尾插
void appendElement(NodePtr paraHeader, char paraChar) {
	NodePtr p, q;

	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;
	q->next =nullptr;

	p = paraHeader;
	while (p->next != nullptr) {
		p = p->next;
	}
	p->next = q;
}
//插入指定位置
void insertElement(NodePtr paraHeader, char paraChar, int paraPosition) {
	NodePtr p, q;
	//当插入位置小于0时
	/*if (paraPosition < 0){
		printf("The position %d is beyond the scope of the list.", paraPosition);
		return;
	}*/
	p = paraHeader;
	for (int i = 0; i < paraPosition; i++) {
		p = p->next;
		if (p == nullptr) {
			printf("The position %d is beyond the scope of the list.", paraPosition);
			return;
		}
	}
	q = (NodePtr)malloc(sizeof(LNode));
	q->data = paraChar;

	printf("linking\r\n");
	q->next = p->next;
	p->next = q;
}
//删除指定数据
void deleteElement(NodePtr paraHeader, char paraChar) {
	NodePtr p, q;
	p = paraHeader;
	while ((p->next != nullptr) && (p->next->data != paraChar)) {
		p = p->next;
	}

	if (p->next == nullptr) {
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}
	q = p->next;
	p->next = p->next->next;
	free(q);
}

void appendInsertDeleteTest() {
	LinkList tempList = initLinkList();
	printList(tempList);

	appendElement(tempList, 'H');
	appendElement(tempList, 'e');
	appendElement(tempList, 'l');
	appendElement(tempList, 'l');
	appendElement(tempList, 'o');
	appendElement(tempList, '!');
	printList(tempList);

	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);

	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: %lld, %lld, %lld\r\n",&tempNode1, &tempNode1.data, &tempNode1.next);
	printf("The second node: %lld, %lld, %lld\r\n",&tempNode2, &tempNode2.data, &tempNode2.next);
}

int main()
{
	appendInsertDeleteTest();
	basicAddressTest();
	return 0;
}

运行结果：

画图分析：

单链表是一种方便数据增删和能动态分配内存空间的一种链式数据结构，其底层代码逻辑是开辟一个节点，其数据域储存数据，指针域储存指向下一个节点的地址。其缺点是访问节点不方便，空间开销大且不能逆向遍历

扩展：

1.头插法

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

2.删除指定数据时删除链表全部该数据

void deleteAllElement(NodePtr paraHeader, char paraChar) {
	NodePtr p, q;
	p = paraHeader;
	int flag = 0;
	while (p->next != nullptr) {
		if (p->next->data == paraChar) {
			flag = 1;
			q = p->next;
			p->next = p->next->next;
			free(q);
		}
		else p = p->next;
	}

	if (flag == 0) {
		printf("Cannot delete %c\r\n", paraChar);
	}
}

end