数据结构之线性表

        这节课上主要进行了线性表的学习，下面是线性表的有关操作代码和运行结果。

1.代码

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

#define LIST_MAX_LENGTH 10

/**
 *Linear list of integers. The key is data.（整数的线性表，key作为数据）
 */
typedef struct SequentialList {
	int actualLength;

	int data[LIST_MAX_LENGTH];//The maximum length is fixed（最大的长度是被限定的）
} *SequentialListPtr;

/**
 * Output the list.（输出表操作）
 */
void outputList(SequentialListPtr paraList) {
	for (int i = 0;i < paraList->actualLength;i++) {
		printf("%d ", paraList->data[i]);
	}// Of for i（用i作为索引输出表中data数组中的数据）
	printf("\r\n");
}// Of outputList

/**
 * Output the memory for the list.（输出表中存储的内容）
 */
void outputMemory(SequentialListPtr paraListPtr) {
	printf("The address of the structure: %ld\r\n", paraListPtr);
	printf("The address of actualLength: %ld\r\n", &paraListPtr->actualLength);
	printf("The address of data: %ld\r\n", &paraListPtr->data);
	printf("The address of actual data: %ld\r\n", &paraListPtr->data[0]);
	printf("The address of second data: %ld\r\n", &paraListPtr->data[1]);
}// Of outputMemory

/**
 *Initialize a sequential list. No error checking for this function.（初始化一个顺序列表，此函数没有错误检查）
 * @param paraListPtr The pointer to the list. It must be a pointer to change the list.（由于必须使用指针去修改这个顺序列表，则paraListPtr是指向这个表的指针）
 * @param paraValues An int array storing all elements.（paraValues是一个存储所有元素的整数数组）
 */
SequentialListPtr sequentialListInit(int paraData[], int paraLength) {
	SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));//为该顺序列表开辟空间
	for (int i = 0;i < paraLength;i++) {
		resultPtr->data[i] = paraData[i];//将目标数组的数据赋值入表中data
	}// Of for i
	resultPtr->actualLength = paraLength;

	return resultPtr;
}// Of sequentialListInit

/**
 * Insert an element into a sequential linear list.（将一个元素添加进顺序线性表中）
 * @param paraListPtr The pointer to the list. It must be a pointer to change the list.
 * @param paraPosition The position, e.g.,0 stands for inserting at the first position.（paraPosition代表元素插入该表中的位置）
 * @param paraValue The value to be inserted.（paraValue代表将被插入的元素的值）
 */
void sequentialListInsert(SequentialListPtr paraListPtr, int paraPosition, int paraValue) {
	// Step 1. Space check.（检查表是否已满）
	if (paraListPtr->actualLength >= LIST_MAX_LENGTH) {
		printf("Cannot insert element: list full.\r\n");
		return;
	}// Of if

	// Step 2. POsition check.（检查插入的位置是否合法）
	if (paraPosition < 0) {
		printf("Cannot insert element: negative position unsupported.");
		return;
	}// Of if
	if (paraPosition > paraListPtr->actualLength) {
		printf("Cannot insert element: the position %d is bigger than the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
		return;
	}// Of if

	// Step 3. Move the remaining part.（移动插入位置之后的部分）
	for (int i = paraListPtr->actualLength;i > paraPosition;i--) {
		paraListPtr->data[i] = paraListPtr->data[i - 1];
	}// Of for i

	// Step 4. Insert.
	paraListPtr->data[paraPosition] = paraValue;

	// Step 5. Update the length.
	paraListPtr->actualLength++;
}// Of sequentialListInsert

/**
 * Test the insert function. （测试上面的添加元素的函数是否有效）
 */
void sequentialInsertTest() {
	int i;
	int tempArray[5] = { 3,5,2,7,4 };

	printf("--- sequentialInsertTest begins. ---\r\n");

	// Initialize（初始化）
	SequentialListPtr tempList = sequentialListInit(tempArray, 5);
	printf("After initialization, the list is: ");
	outputList(tempList);

	// Insert to the first.（插入到第一项）
	printf("Now insert to the first, the list is: ");
	sequentialListInsert(tempList, 0, 8);
	outputList(tempList);

	// Insert to the last.（插入到最后）
	printf("Now insert to the last, the list is: ");
	sequentialListInsert(tempList, 6, 9);
	outputList(tempList);

	// Insert beyond the tail.（插入位置超过最后一个元素）
	printf("Now insert beyond the tail. \r\n");
	sequentialListInsert(tempList, 8, 9);
	printf("The list is:");
	outputList(tempList);

	// Insert to position 3.（插入三次数据）
	for (i = 0;i < 5;i++) {
		printf("Inserting %d.\r\n", (i + 10));
		sequentialListInsert(tempList, 0, (i + 10));
		outputList(tempList);
	}// Of for i

	printf("--- sequentialInsertTest ends. ---\r\n");
}// Of sequentialInsertTest

/**
 * Delete an element from a sequential linear list.
 * @param paraListPtr The pointer to the list.It must be a pointer to change the list.
 * @param paraPosition The position, e.g.,0 stands for inserting at the first position.
 * @return The deleted value.
 */ 
int sequentialListDelete(SequentialListPtr paraListPtr, int paraPosition) {
	// Step 1. Position check.
	if (paraPosition < 0) {
		printf("Invalid position: %d.\r\n", paraPosition);
		return -1;
	}// Of if

	if (paraPosition >= paraListPtr->actualLength) {
		printf("Cannot delete element: the position %d is beyond the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
		return -1;
	}// Of if

	// Step 2. Move the remaining part.
	int resultValue = paraListPtr->data[paraPosition];
	for (int i = paraPosition;i < paraListPtr->actualLength;i++) {
		paraListPtr->data[i] = paraListPtr->data[i + 1];
	}// Of for i

	// Step 3. Update the length.
	paraListPtr->actualLength--;

	// Step 4. Return the value.
	return resultValue;
}// Of sequentialListDelete

/**
 * Test the delete function
 */
void sequentialDeleteTest() {
	int tempArray[5] = { 3,5,2,7,4 };

	printf("---- sequentialDeleteTest begins. ----\r\n");

	// Initialize.
	SequentialListPtr tempList = sequentialListInit(tempArray, 5);
	printf("After initialization,the list is: ");
	outputList(tempList);
	
	// Delete the first.
	printf("Now delete the first, the list is: ");
	sequentialListDelete(tempList, 0);
	outputList(tempList);

	// Delete the last.
	printf("Now delete the last, the list is: ");
	sequentialListDelete(tempList, 3);
	outputList(tempList);

	// Delete the second.
	printf("Now delete the second, the list is: ");
	sequentialListDelete(tempList, 1);
	outputList(tempList);

	// Delete the wrong position
	printf("Now delete the 5th, the list is: ");
	sequentialListDelete(tempList, 5);
	outputList(tempList);

	// Delete the wrong position
	printf("Now delete the (-6)th, the list is: ");
	sequentialListDelete(tempList, -6);
	outputList(tempList);

	printf("---- sequentialDeleteTest ends. ----\r\n");

	outputMemory(tempList);
}// Of sequentialDeleteTest

/**
 * Locate an element in the list.
 * @param paraListPtr The pointer to the list.
 * @param paraValue the indicated value.
 * @return The position of the value,or -1 indicating not exists
 */
int locateElement(SequentialListPtr paraListPtr, int paraValue) {
	for (int i = 0;i < paraListPtr->actualLength;i++) {
		if (paraListPtr->data[i] == paraValue) {
			return i;
		}// Of if
	}// Of for i

	return -1;
}// Of locateElement

/**
 * Get an element in the list.
 * @param paraListPtr The pointer to the list.
 * @param paraPosition The given position.
 * @return The position of the value, or -1 indicating not exists.
 */
int getElement(SequentialListPtr paraListPtr, int paraPosition) {
	// Step 1. Position check.
	if (paraPosition < 0) {
		printf("Invalid position: %d.\r\n", paraPosition);
		return -1;
	}// Of if

	if (paraPosition >= paraListPtr->actualLength) {
		printf("Cannot get element: the position%d is beyond the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
		return -1;
	}// Of if

	return paraListPtr->data[paraPosition];
}// Of locateElement

/**
 * Clear elements in the list.
 * @param paraListPtr The pointer to the list.
 * @return The position of the value, or -1 indicating not exists.
 */
void clearList(SequentialListPtr paraListPtr) {
	paraListPtr->actualLength = 0;
}// Of clearList

/**
 The entrance.
 */
void main() {
	sequentialInsertTest();
	sequentialDeleteTest();
}// Of main

2.运行结果

The list is:8 3 5 2 7 4 9
Inserting 10.
10 8 3 5 2 7 4 9
Inserting 11.
11 10 8 3 5 2 7 4 9
Inserting 12.
12 11 10 8 3 5 2 7 4 9
Inserting 13.
Cannot insert element: list full.
12 11 10 8 3 5 2 7 4 9                                                                                                  10 8 3 5 2 7 4 9
Inserting 11.
11 10 8 3 5 2 7 4 9
Inserting 12.
12 11 10 8 3 5 2 7 4 9
Inserting 13.
Cannot insert element: list full.
12 11 10 8 3 5 2 7 4 9
Inserting 14.
Cannot insert element: list full.
12 11 10 8 3 5 2 7 4 9
--- sequentialInsertTest ends. ---
---- sequentialDeleteTest begins. ----
After initialization,the list is: 3 5 2 7 4
Now delete the first, the list is: 5 2 7 4
Now delete the last, the list is: 5 2 7
Now delete the second, the list is: 5 7
Now delete the 5th, the list is: Cannot delete element: the position 5 is beyond the list length 2.
5 7
Now delete the (-6)th, the list is: Invalid position: -6.
5 7
---- sequentialDeleteTest ends. ----

对于这种功能比较多的代码，写上清晰易懂的注释才不会迷失在各种定义当中。