Space at 1 allocated.
linking
Space at 2 allocated.
linking
Space at 3 allocated.
linking
Space at 4 allocated.
linking
No space.
Hell
Deleting'e'.
Deleting'a'.
Cannot delete a
Deleting'o'.
Cannot delete o
Hll
Space at 2 allocated.
linking
Hxll
D:\数据算法\静态链表\x64\Debug\静态链表.exe (进程 16616)已退出,代码为 0。
按任意键关闭此窗口. . .
1.静态链表:分配一整片连续的内存空间,各个结点集中安置,逻辑结构上相邻的数据元素,存储在指定的一块内存空间中,数据元素只允许在这块内存空间中随机存放,这样的存储结构生成的链表称为静态链表。也就是说静态链表是用数组来实现链式存储结构,静态链表实际上就是一个结构体数组。
2.静态链表包括:
数据域:用于存储数据元素的值;
游标:其实就是数组下标,表示直接后继元素所在数组中的位置;
3.备用链表:
备用链表的作用是回收数组中未使用或之前使用过(目前未使用)的存储空间,留待后期使用。也就是说,静态链表使用数组申请的物理空间中,存有两个链表,一条连接数据,另一条连接数组中未使用的空间。通常,备用链表的表头位于数组下标为 0(a[0]) 的位置,而数据链表的表头位于数组下标为 1(a[1])的位置。静态链表中设置备用链表的好处是,可以清楚地知道数组中是否有空闲位置,以便数据链表添加新数据时使用。比如,若静态链表中数组下标为 0 的位置上存有数据,则证明数组已满。
#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;
/*
* Initialize the list with a header.
* @return The pointer to the header.
*/
ListPtr initLinkedList() {
//The pointer to the whole list space.
ListPtr tempPtr = (ListPtr)malloc(sizeof(struct StaticLinkedList));
//Allocate total space.
tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);
//The first node is the header.
tempPtr->nodes[0].data = '\0';
tempPtr->nodes[0].next = -1;
//only the first node is used.
tempPtr->used[0] = 0;
for (int i = 1; i < DEFAULT_SIZE; i++) {
tempPtr->used[i] = 0;
}
return tempPtr;
}
/*
* Print the list.
* @param oaraListPtr The pointer to the list.
*/
void printList(ListPtr paraListPtr) {
int p = 0;
while (p != -1) {
printf("%c", paraListPtr->nodes[p].data);
p = paraListPtr->nodes[p].next;
}
printf("\r\n");
}
/*
* Insert an element to the given position.
* @param paraListPtr the position of the list.
* ¶m paraChar the given char.
* @param paraPosition the given position.
*/
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition) {
int p, q, i;
//step 1. search to the position.
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;
}
}
//step 2.consruct a new node.
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;
//strp 3. now link.
printf("linking\r\n");
paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
paraListPtr->nodes[p].next = q;
}
/*
* Delete an element fron the list.
* @param paraHeader the header of the list.
* @param paraChar the given char.
*/
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;
}
/*
* 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.Delte some characters
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();
}
Space at 1 allocated.
linking
Space at 2 allocated.
linking
Space at 3 allocated.
linking
Space at 4 allocated.
linking
No space.
Hell
Deleting'e'.
Deleting'a'.
Cannot delete a
Deleting'o'.
Cannot delete o
Hll
Space at 2 allocated.
linking
Hxll
D:\数据算法\静态链表\x64\Debug\静态链表.exe (进程 16616)已退出,代码为 0。
按任意键关闭此窗口. . .