前言——静态链表含义
对于线性链表,也可用一维数组来进行描述。这种描述方法便于在没有指针类型的高级程序设计语言中使用链表结构。
一、静态链表结构(图解)
二、静态链表实际操作
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(struct StaticLinkedList));
tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * MAXSIZE);
tempPtr->used = (int*)malloc(sizeof(int) * MAXSIZE);
tempPtr->nodes[0].data = '\0';
tempPtr->nodes[0].next = -1;
tempPtr->used[0] = 1;
int i;
for (i = 1; i < MAXSIZE; 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;
p = 0;
for (i = 0; i < paraPosition; i ++) {
p = paraListPtr->nodes[p].next;
if (p == -1) {
printf("%d的位置超出列表范围!\n", paraPosition);
return;
}
}
for (i = 1; i < MAXSIZE; i ++){
if (paraListPtr->used[i] == 0){
printf("已分配空间%d.\n", i);
paraListPtr->used[i] = 1;
q = i;
break;
}
}
if (i == MAXSIZE){
printf("没有空间.\r\n");
return;
}
paraListPtr->nodes[q].data = paraChar;
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("不能删除%c\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(){
ListPtr tempList = initLinkedList();
printList(tempList);
insertElement(tempList, 'p', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
insertElement(tempList, 'n', 5);
insertElement(tempList, 'o', 6);
printList(tempList);
printf("Deleting 'e'.\n");
deleteElement(tempList, 'e');
printf("Deleting 'a'.\n");
deleteElement(tempList, 'a');
printf("Deleting 'o'.\n");
deleteElement(tempList, 'o');
printf("Deleting 'l'.\n");
deleteElement(tempList, 'w');
printList(tempList);
printf("Deleting 'p'.\n");
deleteElement(tempList, 'p');
printList(tempList) ;
insertElement(tempList, '0', 1);
printList(tempList);
}
三、完整代码
#include <stdio.h>
#include <malloc.h>
#define MAXSIZE 10
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) * MAXSIZE);
tempPtr->used = (int*)malloc(sizeof(int) * MAXSIZE);
tempPtr->nodes[0].data = '\0';
tempPtr->nodes[0].next = -1;
tempPtr->used[0] = 1;
int i;
for (i = 1; i < MAXSIZE; 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("%d的位置超出列表范围!\n", paraPosition);
return;
}
}
for (i = 1; i < MAXSIZE; i ++){
if (paraListPtr->used[i] == 0){
printf("已分配空间%d.\n", i);
paraListPtr->used[i] = 1;
q = i;
break;
}
}
if (i == MAXSIZE){
printf("没有空间.\r\n");
return;
}
paraListPtr->nodes[q].data = paraChar;
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("不能删除%c\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, 'p', 0);
insertElement(tempList, 'e', 1);
insertElement(tempList, 'l', 2);
insertElement(tempList, 'l', 3);
insertElement(tempList, 'o', 4);
insertElement(tempList, 'n', 5);
insertElement(tempList, 'o', 6);
printList(tempList);
printf("Deleting 'e'.\n");
deleteElement(tempList, 'e');
printf("Deleting 'a'.\n");
deleteElement(tempList, 'a');
printf("Deleting 'o'.\n");
deleteElement(tempList, 'o');
printf("Deleting 'l'.\n");
deleteElement(tempList, 'w');
printList(tempList);
printf("Deleting 'p'.\n");
deleteElement(tempList, 'p');
printList(tempList) ;
insertElement(tempList, '0', 1);
printList(tempList);
}
int main(){
appendInsertDeleteTest();
}