2.4静态链表

1.静态链表

用数组描述的链表，即称为静态链表。

在C语言中，静态链表的表现形式即为结构体数组，结构体变量包括数据域data和游标。

优点：

这种存储结构，仍需要预先分配一个较大的空间，但在作为线性表的插入和删除操作时不需移动元素，仅需修改指针，故仍具有链式存储结构的主要优点。

2.构建结构体

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

3.创建一个

ListPtr initLinkedList(){
	// The pointer to the whole list space.
	ListPtr tempPtr = (ListPtr)malloc(sizeof(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;

3.输出：

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

}

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("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;
}

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("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;
}

6代码

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