静态链表作业

"the

code

is

"

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

#define DEFAULT_SIZE 5

typedef struct StaticLinkedNode//节点
{
	char date;//储存的内容

	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);//nodeptr是一个指针，因而可以开很多空间
	tempPtr->used = (int*)malloc(sizeof(int) * DEFAULT_SIZE);//是否占用数组

	tempPtr->nodes[0].date = '\0';
	tempPtr->nodes[0].next = -1;//所有next都是-1了
	tempPtr->used[0] = 1;//仅第一个用了
	for (int i = 0; i < DEFAULT_SIZE; i++)
	{
		tempPtr->used[i] = 0;//头指针
	}
	return tempPtr;
}
void printList(ListPtr paraListPtr)
{
	int p = 0;//p就是地址，指针
	while (p != -1)
	{
		printf("%c", paraListPtr->nodes[p].date);
		p = paraListPtr->nodes[p].next;
	}
	printf("\r\n");
}
//从1始，
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition)
{
	int p, q, i;//p来存要插入的位置，q存新用的位置
	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);
			q = i;
			break;
		}
	}
	if (i == DEFAULT_SIZE)
	{
		printf("No space.\r\n");
		return;
	}
	paraListPtr->nodes[q].date = 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].date != 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();
}

插入

删除

静态链表是无指针语言使用链表的手段