数据结构：静态链表

1.定义并创建

#define DEFAULT_SIZE 5
typedef struct StaticLinkedNode {
	char data;
	int next;
 
} *NodePtr;
 
typedef struct StaticLinkedList {
	NodePtr nodes;
	int* used;
 
} *ListPtr;
ListPtr initLinkedList() {
	ListPtr tempPtr = (ListPtr)malloc(sizeof(StaticLinkedList));
	tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
	tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);
	tempPtr->nodes[0].data = '\0';
	tempPtr->nodes[0].next = -1;
 
		tempPtr->used[0] = 1;
	for (int i = 1; i < DEFAULT_SIZE; i ++) {
		tempPtr->used[i] = 0;
	}
 
	return tempPtr;
}

 

2.打印链表

void printList(ListPtr paraListPtr) {
	int p = 0;
 
	//遍历链表的操作
	while (p != -1) {//当还存在下一个结点
		printf("%c", paraListPtr->nodes[p].data);
		p = paraListPtr->nodes[p].next;//获取下一个结点的下标
	}
 
	printf("\r\n");
}

 3.指定位置插入

void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition) {
	int p, q, i;
 
	p = 0;
	for (i = 0; i < paraPosition; i ++) {
		p = paraListPtr->nodes[p].next;
		if (p == -1) {
			printf("这个位置：%d 超过了该链表当前的大小\r\n", paraPosition);
			return;
		}// Of if
	} // Of for i
 
	for (i = 1; i < DEFAULT_SIZE; i ++) {
		if (paraListPtr->used[i] == 0) {
			printf("这个结点被存放在nodes数组的下标为 %d 的空间里.\r\n", i);
			paraListPtr->used[i] = 1;
			q = i;
			break;
		}
	}
	if (i == DEFAULT_SIZE) {
		printf("No space.\r\n");
		return;
	}
 
	paraListPtr->nodes[q].data = paraChar;
 
	printf("linking\r\n");
	paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = q;
}

4.删除操作

void deleteElement(ListPtr paraListPtr, char paraChar) {
	int p, q;
	p = 0;
 
 
	while ((paraListPtr->nodes[p].next != -1) 
		&&
		(paraListPtr->nodes[
			paraListPtr->nodes[p].next   
			].data != paraChar)
		) {
		p = paraListPtr->nodes[p].next;
	}
 
	if (paraListPtr->nodes[p].next == -1) {
		printf("无法删除 %c\r\n", paraChar);
		return;
	}
 
	q = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
 
	// This statement is identical to free(q)
	paraListPtr->used[q] = 0;
}

 5.完整代码

#include <stdio.h>
#include <malloc.h>
 
#define DEFAULT_SIZE 5
 
 

typedef struct StaticLinkedNode {
	
	int next;
 
} *NodePtr;
 

typedef struct StaticLinkedList {
	NodePtr nodes;
	int* used;
 
} *ListPtr;
 

ListPtr initLinkedList() {
	//创建一个指针指向该链表所在的空间
	ListPtr tempPtr = (ListPtr)malloc(sizeof(StaticLinkedList));
 
	// 分配内存空间给nodes数组和used数组
	tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
	tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);
 

	tempPtr->nodes[0].data = '\0';
	tempPtr->nodes[0].next = -1;
 
	tempPtr->used[0] = 1;
	for (int i = 1; i < DEFAULT_SIZE; i ++) {
		tempPtr->used[i] = 0;
	}
 
	return tempPtr;
}
 
/**
 * @brief 打印静态链表
 *
 * @param paraListPtr 指向静态链表的指针
 */
void printList(ListPtr paraListPtr) {
	int p = 0;
 
	//遍历链表的操作
	while (p != -1) {//当还存在下一个结点
		printf("%c", paraListPtr->nodes[p].data);
		p = paraListPtr->nodes[p].next;//获取下一个结点的下标
	}
 
	printf("\r\n");
}
 

void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition) {
	int p, q, i;
 
	p = 0;
	for (i = 0; i < paraPosition; i ++) {
		p = paraListPtr->nodes[p].next;
		if (p == -1) {
			printf("这个位置：%d 超过了该链表当前的大小\r\n", paraPosition);
			return;
		}// Of if
	} // Of for i
 
	for (i = 1; i < DEFAULT_SIZE; i ++) {
		if (paraListPtr->used[i] == 0) {
			printf("这个结点被存放在nodes数组的下标为 %d 的空间里.\r\n", i);
			paraListPtr->used[i] = 1;
			q = i;
			break;
		}
	}
	if (i == DEFAULT_SIZE) {
		printf("No space.\r\n");
		return;
	}
 
	paraListPtr->nodes[q].data = paraChar;

	printf("linking\r\n");
	paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = q;
}
 
 
void deleteElement(ListPtr paraListPtr, char paraChar) {
	int p, q;
	p = 0;
 
 
	while ((paraListPtr->nodes[p].next != -1) 
		&&
		(paraListPtr->nodes[
			paraListPtr->nodes[p].next   
			].data != paraChar)
		) {
		p = paraListPtr->nodes[p].next;
	}
 
	if (paraListPtr->nodes[p].next == -1) {
		printf("无法删除 %c\r\n", paraChar);
		return;
	}
 
	q = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
 
	// This statement is identical to free(q)
	paraListPtr->used[q] = 0;
}
/**
 * Unit test.
 */
void appendInsertDeleteTest(){
	// Step 1. Initialize an empty list.
	ListPtr tempList = initLinkedList();
	printList(tempList);
 
	// Step 2. Add some characters.
	insertElement(tempList, 'H', 0);
	insertElement(tempList, 'e', 1);
	insertElement(tempList, 'l', 2);
	insertElement(tempList, 'l', 3);
	insertElement(tempList, 'o', 4);
	printList(tempList);
 
	// Step 3. Delete some characters (the first occurrence).
	printf("Deleting 'e'.\r\n");
	deleteElement(tempList, 'e');
	printf("Deleting 'a'.\r\n");
	deleteElement(tempList, 'a');
	printf("Deleting 'o'.\r\n");
	deleteElement(tempList, 'o');
	printList(tempList);
 
	insertElement(tempList, 'x', 1);
	printList(tempList);
}// Of appendInsertDeleteTest
 
/**
 * The entrance.
 */
int main(){
	appendInsertDeleteTest();
}