数据结构：静态链表-CSDN博客

本文链接：https://blog.csdn.net/qq_74329457/article/details/130068150

文章提供了一个C语言程序，用于实现静态链表的数据结构。它包含了初始化链表、在指定位置插入元素、按字符删除元素的功能。程序首先初始化链表，然后添加字符，接着演示删除过程，并在末尾添加更多字符，展示了静态链表的基本操作。

摘要由CSDN通过智能技术生成

代码：

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

#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(struct 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;
	}//of for i
	
	return tempPtr;
}//of initLinkedList

/*print*/
void printList(ListPtr paraListPtr){
	int p=0;
	while(p!=-1){
			printf("%c",paraListPtr->nodes[p].data);
			p=paraListPtr->nodes[p].next;
		}//of while
		printf("\r\n");
}// of printList

/*插入*/
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("The position %d is beyond the scope of the list.\r\n", paraPosition);
			return;
		}// Of if
	} // Of for i

	for (i = 1; i < DEFAULT_SIZE; i ++){
		if (paraListPtr->used[i] == 0){
			printf("Space at %d allocated.\r\n", i);
			paraListPtr->used[i] = 1;
			q = i;
			break;
		}// Of if
	}// Of for i
	if (i == DEFAULT_SIZE){
		printf("No space.\r\n");
		return;
	}// Of if

	paraListPtr->nodes[q].data = paraChar;
	printf("linking\r\n");
	paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = q;
}// Of insertElement

/*删除*/
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;
	}// Of while

	if (paraListPtr->nodes[p].next == -1) {
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}// Of if

	q = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
	paraListPtr->used[q] = 0;
}// Of deleteElement

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

/*进入*/
int main(){
	appendInsertDeleteTest();
}// Of main

运行结果：

收获：

初始化：used首先占据第一个位置,并初始化为1，node[0].data初始化为空，node[0].next初始化为-1；然后used后面都初始化为0；插入：先查找所要插入位置的前一个元素，创建一个新节点放入相应元素。删除：查找结点a（i-1）并由指针p指向该结点。临时保存待删除结点a（i）的地址在q中，以备释放。将结点*p的指针域指向a（i）的直接后继结点。释放结点a（i）的空间。