静态链表笔记

静态链表：用数组代替指针来描述单链表，也叫游标实现法。分配一整片连续的内存空间，各个结点集中安置，逻辑结构上相邻的数据元素，存储在指定的一块内存空间中，数据元素只允许在这块内存空间中随机存放，这样的存储结构生成的链表称为静态链表。

特点：静态链表所分配的存储数据的空间是相邻的，这个空间类似于数组空间，数据全部储存在数组中，但储存位置是随机的。静态链表还分配一个数组大小和存储数据的数组大小相同的空间，用于0和1标记存储数据的空间是否被使用。同时静态链表的空间在使用过程中大小不变。

 

注意：静态链表存储数据元素的个数从其创建时就已经确定，后期无法更改。

静态链表存储结构：以“数组+游标”的方式存储具有线性关系数据

代码如下：

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

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] = -1;
	for (int i = 1; i < DEFAULT_SIZE; i++)
	{
		tempPtr->used[i] = 0;
	}// Of for i

	return tempPtr;
}// Of initLinkedList

void printList(ListPtr paraListPtr)
{
	int p = 0;
	while (p != -1)
	{
		printf("%c", paraListPtr->nodes[p].data);
		p = paraListPtr->nodes[p].next;
	}// Of while
	printf("\r\n");
}// Of printList

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;
		}//Of if
	}//Of for i

	//step 2:Construct anew node
	for (i = 1; i < DEFAULT_SIZE; i++)
	{
		if (paraListPtr->used[i] == 0)
		{
			//This is identical to malloc.
			printf("Space at %d allocated.\r\n", i);
			paraListPtr->used[i] = 1;
			q = i;
			break;
		}//Of if
	}//Of for i
	if (i == DEFAULT_SIZE)
	{
		printf("No space.\r\n");
		return;
	}//Of if

	paraListPtr->nodes[q].data = paraChar;

	//Step 3: Now link.
	printf("linking\r\n");
	paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = q;

}// Of insertElement

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;
	}// Of while

	if (paraListPtr->nodes[p].next == -1)
	{
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}// Of if

	q = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;

	//This statement is identical to free(q)
	paraListPtr->used[q] = 0;
}// Of deleteElement

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: Delete some characters(the first occurence).
	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);

}// Of appendInsertDeletTest

int main()
{
	appendInsertDeleteTest();
	return 0;
}