静态链表（作业）

1.代码

#include<stdio.h>
#include<malloc.h>

#define DEFAULT_SIZE 5

typedef struct StaticLinkedNode {
	char data;
	int next;
}*NodePtr;
typedef struct StaticLinkedList {
	NodePtr node;
	int* used;
}*ListPtr;

ListPtr initLinkedList() {
	ListPtr tempPtr = (ListPtr)malloc(sizeof(struct StaticLinkedList));
	tempPtr->node = (NodePtr)malloc(sizeof(struct StaticLinkedNode) * DEFAULT_SIZE);
	tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);

	tempPtr->node[0].data = '\0';
	tempPtr->node[0].next = -1;

	tempPtr->used[0] = 1;
	for (int i = 1; i < DEFAULT_SIZE; i++) {
		tempPtr->used[i] = 0;
	}

	return tempPtr;
}

void printList(ListPtr paraLisrPtr) {
	int p = 0;
	while (p != -1) {
		printf("%c", paraLisrPtr->node[p].data);
		p = paraLisrPtr->node[p].next;
	}
	printf("\n");
}
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition) {
	int p, q, i;
	p = 0;
	for (i = 0; i < paraPosition; i++) {
		p = paraListPtr->node[p].next;
		if (p == -1) {
			printf("The position %d is beyond the scope of the list.\n", paraPosition);
			return;
		}
	}

	for (i = 1; i < DEFAULT_SIZE; i++) {
		if (paraListPtr->used[i] == 0) {
			printf("Space at %d allocated.\n", i);
			paraListPtr->used[i] = 1;
			q = i;
			break;
		}
	}
	if (i == DEFAULT_SIZE) {
		printf("No space.\n");
		return;
	}
	paraListPtr->node[q].data = paraChar;

	printf("linking\n");
	paraListPtr->node[q].next = paraListPtr->node[p].next;
	paraListPtr->node[p].next = q;
}
void deleteElement(ListPtr paraListPtr, char paraChar) {
	int p, q;
	p = 0;
	while ((paraListPtr->node[p].next != -1) && (paraListPtr->node[paraListPtr->node[p].next].data != paraChar)) {
		p = paraListPtr->node[p].next;
	}
	if (paraListPtr->node[p].next == -1) {
		printf("Cannot delete %c\n", paraChar);
		return;
	}
	q = paraListPtr->node[p].next;
	paraListPtr->node[p].next = paraListPtr->node[paraListPtr->node[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'.\n");
	deleteElement(tempList,'e');
	printf("Deleting'a'.\n");
	deleteElement(tempList, 'a');
	printf("Deleting'a'.\n");
	deleteElement(tempList, 'o');
	printList(tempList);
	insertElement(tempList, 'x', 1);
	printList(tempList);
}
int main() {
	appendInsertDeleteTest();
}

2.运行结果

3.心得体会

在堆上开辟空间实现静态链表，也可以用全局变量来生成一片空间来实现静态链表