1.定义结构体
typedef struct StaticLinkedNode {
char data;
int next;
}*NodePtr;
typedef struct StaticLinkedList {
NodePtr nodes;
int* used;
} *ListPtr;
2.初始化
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;
}
3.打印链表
void printList(ListPtr paraListPtr)
{
int p = 0;
while (p != -1)
{
printf("%c", paraListPtr->nodes[p].data);
p = paraListPtr->nodes[p].next;
}
printf("\r\n");
}
4.插入元素
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("所给位置超出范围\r\n");
return;
}
}
//创建创建新结点
for (i = 1; i < DEFAULT_SIZE; i++) {
if (paraListPtr->used[i] == 0) {
// This is identical to malloc.
printf("在第 %d 个位置空余.\r\n", i);
paraListPtr->used[i] = 1;
q = i;
break;
}
}
if (i == DEFAULT_SIZE)
{
printf("没有空间了\n\r");
return;
}
paraListPtr->nodes[q].data = paraChar;
//连接结点
printf("连接中\r\n");
paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = q;
}
5.删除元素
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("没有要删除的元素\r\n", paraChar);
return;
}
q = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
paraListPtr->used[q] = 0;
}
6.插入删除测试
void appendInsertDeleteTest() {
// Step 1. 初始化
ListPtr tempList = initLinkedList();
printList(tempList);
// Step 2. 添加元素
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
printList(tempList);
// Step 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);
}
7.完整代码
#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(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;
}
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;
//1.查找位置
p = 0;
for (i = 0; i < paraPosition; i++)
{
p = paraListPtr->nodes[p].next;
if (p == -1)
{
printf("所给位置超出范围\r\n");
return;
}
}
//创建创建新结点
for (i = 1; i < DEFAULT_SIZE; i++) {
if (paraListPtr->used[i] == 0) {
// This is identical to malloc.
printf("在第 %d 个位置空余.\r\n", i);
paraListPtr->used[i] = 1;
q = i;
break;
}
}
if (i == DEFAULT_SIZE)
{
printf("没有空间了\n\r");
return;
}
paraListPtr->nodes[q].data = paraChar;
//连接结点
printf("连接中\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("没有要删除的元素\r\n", paraChar);
return;
}
q = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
paraListPtr->used[q] = 0;
}
//测试
void appendInsertDeleteTest() {
// Step 1. 初始化
ListPtr tempList = initLinkedList();
printList(tempList);
// Step 2. 添加元素
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
printList(tempList);
// Step 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();
}
8.运行结果
在第 1 个位置空余.
连接中
在第 2 个位置空余.
连接中
在第 3 个位置空余.
连接中
在第 4 个位置空余.
连接中
没有空间了
Hell
Deleting 'e'.
Deleting 'a'.
没有要删除的元素
Deleting 'o'.
没有要删除的元素
Hll
在第 2 个位置空余.
连接中
Hxll
9.静态链表与动态链表的区别
静态链表用的是相对地址,动态链表用绝对地址;
静态链表的初始长度一般是固定的;