数据结构静态链表学习

目录

一.静态链表

二.具体代码展示

1.静态链表的定义

2.初始化静态链表

3.向指定位置插入结点

4.删除指定元素

5.打印链表长度

6.完整代码

7.测试代码

三.总结

四.附上老师的代码

一.静态链表

静态链表同时具有顺序表和链表的一些特征，比如和数组相同的需要在初始化时申请一定大小的空间，用游标替代链表中的指针。

二.具体代码展示

1.静态链表的定义

typedef struct staticLinkedNode{
	char data;
	int next;
}*NodePtr;

typedef struct staticLinkedList{
	NodePtr nodes;
	int *used;
}*ListPtr;

2.初始化静态链表

/**
 * Initialize the list with a header.
 * @return The pointer to the header.
 */
ListPtr initLinkedList(){
	//step 1. // The pointer to the whole list space
	ListPtr tempPtr=(ListPtr)malloc(sizeof(ListPtr));
	
	
	//step 2. Allocate total space.
	tempPtr->nodes=(NodePtr)malloc(sizeof(ListPtr) * DEFAULT_SIZE);
	tempPtr->used=(int*)malloc(sizeof(int) * DEFAULT_SIZE);
	
	//step 3. The first node is the header.
	tempPtr->nodes[0].data='\0';
	tempPtr->nodes[0].next=-1; 
	
	//step 4. Only the first node is used.
	tempPtr->used[0]=1;
	for(int i=1;i<DEFAULT_SIZE;i++){
		tempPtr->used[i]=0;
	}
	
	return tempPtr;
}

3.向指定位置插入结点

这里使用ListPtr->used[x]=1或者0表示第x位是否有数据储存

                                                              图示

 

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

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

4.删除指定元素

                                                                   图示

 

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

5.打印链表长度

/**
 * count the list.
 * @param paraHeader The header of the list.
 */	
void lengthList(ListPtr paraListPtr){
	int p=0,i=0;
	while(paraListPtr->nodes[p].next!=-1){
		p=paraListPtr->nodes[p].next;
		i++;
	}
	printf("长度为%d\r\n",i);
}

6.完整代码

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

#define DEFAULT_SIZE 6

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(){
	//step 1. // The pointer to the whole list space
	ListPtr tempPtr=(ListPtr)malloc(sizeof(ListPtr));
	
	
	//step 2. Allocate total space.
	tempPtr->nodes=(NodePtr)malloc(sizeof(ListPtr) * DEFAULT_SIZE);
	tempPtr->used=(int*)malloc(sizeof(int) * DEFAULT_SIZE);
	
	//step 3. The first node is the header.
	tempPtr->nodes[0].data='\0';
	tempPtr->nodes[0].next=-1; 
	
	//step 4. Only the first node is used.
	tempPtr->used[0]=1;
	for(int 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("\r\n");
}


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

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

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

/**
 * count the list.
 * @param paraHeader The header of the list.
 */	
void lengthList(ListPtr paraListPtr){
	int p=0,i=0;
	while(paraListPtr->nodes[p].next!=-1){
		p=paraListPtr->nodes[p].next;
		i++;
	}
	printf("长度为%d\r\n",i);
}

/**
 * Unit test.
 */
void InsertDeleteTest(){
	// Step 1. Initialize an empty list.
	ListPtr tempList = initLinkedList();
	printList(tempList);

	// Step 2. Add some characters.
	insertElement(tempList, 'C', 0);
	insertElement(tempList, 'Y', 1);
	insertElement(tempList, 'H', 2);
	insertElement(tempList, 'Z', 3);
	insertElement(tempList, 'S', 4);
	insertElement(tempList, '!', 5);
	lengthList(tempList);
	printList(tempList);

	// Step 3. Delete some characters (the first occurrence).
	printf("Deleting 'Y'.\r\n");
	deleteElement(tempList, 'Y');
	printf("Deleting 'H'.\r\n");
	deleteElement(tempList, 'H');
	printf("Deleting 'Z'.\r\n");
	deleteElement(tempList, 'Z');
	printList(tempList);

	insertElement(tempList, 'Y', 1);
	lengthList(tempList);
	printList(tempList);
}

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

7.测试代码

Space at 1 allocated.
linking
Space at 2 allocated.
linking
Space at 3 allocated.
linking
Space at 4 allocated.
linking
Space at 5 allocated.
linking
No space.
长度为5
 CYHZS
Deleting 'Y'.
Deleting 'H'.
Deleting 'Z'.
 CS
Space at 2 allocated.
linking
长度为3
 CYS

三.总结

注意区分链表和静态链表的移动，一个是p=p->next,一个是p=ListPtr->nodes[p].next.

四.附上老师的代码

#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(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 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;
	}// 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