数据结构静态链表

以下是摘抄的代码

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

/**
 * Initialize the list with a header.
 * @return The pointer to the header.
 */
 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
 
 /**
  * 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;
	  }// Of while
	  printf("\r\n");
  }// Of printList
  
  /**
 * Insert an element to the given position.
 * @param paraListPtr The position of the list.
 * @param paraChar The given char.
 * @param paraPosition The given position.
 */
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 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;
		}// 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

/**
 * Delete an element from the list.
 * @param paraHeader The header of the lsit.
 * @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;
	}// 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

/**
 * 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);
}// Of appendInsertDeleteTest

/**
 * The entrance.
 */
int main(){
	appendInsertDeleteTest();
}// Of main

以下是运行的结果

Space at 1 allocated.
linking
Space at 2 allocated.
linking
Space at 3 allocated.
linking
Space at 4 allocated.
linking
No space.
 Hell
Deleting 'e'.
Deleting 'a'.
Cannot delete a
Deleting 'o'.
Cannot delete o
 Hll
Space at 2 allocated.
linking
 Hxll

--------------------------------
Process exited after 0.04724 seconds with return value 0
请按任意键继续. . .

静态链表是指在逻辑结构上相邻的数据元素，储存在指定的一块内存空间中，数据元素只允许在这块内存空间中随机存放，优点是和动态链表一样，删除和插入元素复杂度低；不足是和数组一样，需要提前分配一块较大的空间，静态链表的操作包括初始化，结点数据显示，结点申请，头插，释放结点，头删。它综合了顺序表和动态链表的优点：使用数组储存数据元素，便于查找遍历操作；同时，在数组中借鉴了动态链表的特点，在链表中插入或者删除结点时只需更改相关结点，不需要移动大量元素