数据结构 C 代码 2.1: 顺序表作业

 

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

#define LIST_MAX_LENGTH 10

typedef struct SequentialList {
	int actualLength;

	int data[LIST_MAX_LENGTH];
}*SequentialListPtr;//定义一个新的结构体


void outputList(SequentialListPtr paraList) {
	for (int i = 0; i < paraList->actualLength; i++) {
		printf(" %d", paraList->data[i]);
}
	printf(" \r\n");

}//打印该顺序表

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]);
}//观察数据在内存中的具体位置

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];
	}
	resultPtr->actualLength = paraLength;

	return resultPtr;
}//初始化顺序表

void sequentialListInsert(SequentialListPtr paraListPtr, int paraPosition, int paraValue) {
	if (paraListPtr->actualLength >= LIST_MAX_LENGTH) {
		printf("Cannot insert element: list full.\r\n");
		return;
	}
	if (paraPosition < 0) {
		printf("Cannot insert element : negative position unsupported.");
		return;
	}
	if (paraPosition > paraListPtr->actualLength) {
		printf("Cannot insert element : the position %d is bigger than the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
		return;
	}
	for (int i = paraListPtr->actualLength; i > paraPosition; i--) {
		paraListPtr->data[i] = paraListPtr->data[i - 1];
	}

	paraListPtr->data[paraPosition] = paraValue;

	paraListPtr->actualLength++;

}

void sequentialInsertTest() {
	int i;
	int tempArray[5] = { 3,5,2,7,4 };

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

	SequentialListPtr tempList = sequentialListInit(tempArray, 5);

	printf("After initialization,the list is ;");

	outputList(tempList);

	printf("Now insert to the first, the list is: ");

	sequentialListInsert(tempList, 0, 8);

	outputList(tempList);

	printf("Now insert to the last, the list is: ");

	sequentialListInsert(tempList, 6, 9);

	outputList(tempList);

	printf("Now insert beyond the tail. \r\n");

	sequentialListInsert(tempList, 8, 9);

	printf("The list is:");

	outputList(tempList);
	for (i = 0; i < 5; i++) {
		printf("Inserting %d.\r\n", (i + 10));

		sequentialListInsert(tempList, 0, (i + 10));

		outputList(tempList);

	}
	printf("---- sequentialInsertTest ends. ----\r\n");
}//单元测试函数

int sequentialListDelete(SequentialListPtr paraListPtr, int paraPosition) {
	if (paraPosition < 0) {
		printf("Invalid position: %d.\r\n", paraPosition);
		return -1;
	}
	if (paraPosition >= paraListPtr->actualLength) {
		printf("Cannot delete element: the position %d is beyond the list length %d.\r\n", paraPosition, paraListPtr->actualLength);
		return -1;
	}
	int resultValue = paraListPtr->data[paraPosition];
	for (int i = paraPosition; i < paraListPtr->actualLength; i++) {
		paraListPtr->data[i] = paraListPtr->data[i + 1];
	}

	paraListPtr->actualLength--;
	return resultValue;
}//删除某位置

void sequentialDeleteTest() {

	int tempArray[5] = { 3, 5, 2, 7, 4 };

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

	SequentialListPtr tempList = sequentialListInit(tempArray, 5);

	printf("After initialization, the list is: ");

	outputList(tempList);

	printf("Now delete the first, the list is: ");

	sequentialListDelete(tempList, 0);

	outputList(tempList);

	printf("Now delete the last, the list is: ");

	sequentialListDelete(tempList, 3);

	outputList(tempList);

	printf("Now delete the second, the list is: ");

	sequentialListDelete(tempList, 1);

	outputList(tempList);

	printf("Now delete the 5th, the list is: ");

	sequentialListDelete(tempList, 5);

	outputList(tempList);

	printf("Now delete the (-6)th, the list is: ");

	sequentialListDelete(tempList, -6);

	outputList(tempList);

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

	outputMemory(tempList);
}

int locateElement(SequentialListPtr paraListPtr, int paraValue) {
	for (int i = 0; i < paraListPtr->actualLength; i++) {
		if (paraListPtr->data[i] == paraValue) {
			return i;
		}
	}
	return -1;
}

int getElement(SequentialListPtr paraListPtr, int paraPosition) {

	if (paraPosition < 0) {
		printf("Invalid position : %d\r\n", paraPosition);

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

		return -1;
	}
	return paraListPtr->data[paraPosition];
}

void clearList(SequentialListPtr paraListPtr) {

	paraListPtr->actualLength = 0;

}

int main() {
	sequentialInsertTest();
	sequentialDeleteTest();

	return 0;
}

运行结果

心得体会：通过敲出代码，大致了解了其作用和原理。

顺序表中，每个元素的位置都是紧挨着，通过删除添加每个元素也是紧挨。

复习了对函数的使用，简便的主函数能更容易明白。