数据结构 2.4章：静态链表

静态链表

优点
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(void);
void printList(ListPtr paraListPtr);
void insertElement(ListPtr paraListPtr, char paraChar, int paraPosition);
void deleteElement(ListPtr paraListPtr, char paraChar);
void appendInsertDeleteTest(void);

int main(void)
{
	appendInsertDeleteTest();
}
/**
 * Initialize the list with a header
 * return The pointer to the header
 */
ListPtr initLinkedList(void)
{
	// 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;
	int i;
	for (i = 1; i < DEFAULT_SIZE; i ++)
	{
		tempPtr->used[i] = 0;
	}

	return tempPtr;
}

/**
 * Print the list
 * param paraListPtr The pointer to the list
 */
void printList(ListPtr paraListPtr)
{
	int p = 0;
	while (p != -1) 
	{
		printf("%c", paraListPtr->nodes[p].data);
		p = paraListPtr->nodes[p].next;
	}
	printf("\n");
}

/**
 * Insert an element to the given position
 * param paraListPtr The position of the list
 * param paraChar The given char
 * param paraPosition The given positio
 */
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;
		}
	}

	// Step 2. Construct a new 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;
		}
	}
	if (i == DEFAULT_SIZE)
	{
		printf("No space.\r\n");
		return;
	}

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

/**
 * Delete an element from the list
 * param paraHeader The header of the list
 * param paraChar The given char
 */
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;
	
	// This statement is identical to free(q)
	paraListPtr->used[q] = 0;
}

/**
 * Unit test
 */
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);
}