#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: %lld\r\n", paraListPtr);
printf("The address of actualLength: %lld\r\n", ¶ListPtr->actualLength);
printf("the address of data: %lld\r\n", ¶ListPtr->data);
printf("The address of actual data: %lld\r\n", ¶ListPtr->data[0]);
printf("The address of second data: %lld\r\n", ¶ListPtr->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 begins. ----\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");
outputList(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;
}
void main() {
sequentialInsertTest();
sequentialDeleteTest();
}
运行结果
心得:深入了解了列表的创建,插入和删除的方式
画图分析