数据结构第四次作业：静态链表

#include<iostream>
using namespace std;

#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(struct 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;

	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);
}


void main() {
	appendInsertDeleteTest();
}

存储结构： 

静态链表是借助数组来描述线性表的链式存储结构的一种方法。在静态链表中，结点也有数据域和指针域，这里的指针是结点的相对地址），又称游标。静态链表同样需要预先分配一块连续的内存空间。静态链表的主要优点在于其增删操作不需要大量地移动元素，只需要改变相应的游标即可。然而，静态链表也有其缺点，比如不能随机存取元素，只能从头结点开始依次往后查找，且其容量是固定不可变的。

end