一、代码块
静态链表构成
typedef struct StaticLinkedNode{
//next是一个整数,表示相对地址,在操作系统中,应该是绝对地址。这里用-1表示NULL
char data;
int next;
} *NodePtr;
typedef struct StaticLinkedList{
//nodes存储节点,used存储空间使用情况,0表示空闲,1表示被占用
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);
//头结点,nodes[0]永远存储头节点
tempPtr->nodes[0].data = '\0';
tempPtr->nodes[0].next = -1;
//头节点被占用,标记为1,其余为0
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;
//找到插入位置
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;
}
}
//找寻是否有结点未被占用
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;
}
}
//判断链表空间是否足够
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("Cannot delete %c\r\n", paraChar);
return;
}
//删除该元素
q = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
//该结点未被占用
paraListPtr->used[q] = 0;
}
二、全部代码
//
// main.c
//
// Created on 2022/5/2.
//
#include <stdio.h>
#include <malloc.h>
#define DEFAULT_SIZE 5
typedef struct StaticLinkedNode{
//next是一个整数,表示相对地址,在操作系统中,应该是绝对地址。这里用-1表示NULL
char data;
int next;
} *NodePtr;
typedef struct StaticLinkedList{
//nodes存储节点,used存储空间使用情况,0表示空闲,1表示被占用
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);
//头结点,nodes[0]永远存储头节点
tempPtr->nodes[0].data = '\0';
tempPtr->nodes[0].next = -1;
//头节点被占用,标记为1,其余为0
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;
//找到插入位置
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;
}
}
//找寻是否有结点未被占用
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;
}
}
//判断链表空间是否足够
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("Cannot delete %c\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(){
//创建一个空的静态链表
ListPtr tempList = initLinkedList();
printList(tempList);
//添加元素
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
printList(tempList);
//删除元素
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);
}
//main
void main(){
appendInsertDeleteTest();
}
三、部分代码图示
- void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition)
insertElement(tempList, 'H', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
- void deleteElement(ListPtr paraListPtr, char paraChar)
deleteElement(tempList, 'e');
deleteElement(tempList, 'a');
deleteElement(tempList, 'o');
insertElement(tempList, 'x', 1);
四、小结
用数组描述的链表,即称为静态链表。
静态链表需要预先分配一个较大的空间,但在作为线性表的插入和删除操作时不需移动元素,仅需修改指针。