代码:
#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 StaticLinkedList)*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;
}
//打印链表
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");
}
//插入
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition)
{
int p, q, i;
//1、找到位置
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 it
}//of for i
//2、创建节点
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;
//3、连接
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;
}//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;
}
//测试
void appendInsertDeleteTest(){
//1.初始化一个空链表
ListPtr tempList = initLinkedList();
printList(tempList);
// 2. 增添元素
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
printList(tempList);
//3.删除第一次出现的元素
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);
}
void main()
{
appendInsertDeleteTest();
}
运行结果: