Day one 线性表

最新推荐文章于 2024-03-01 15:46:32 发布

陈皮话梅糖991

最新推荐文章于 2024-03-01 15:46:32 发布

阅读量123

点赞数

文章标签： c语言

本文链接：https://blog.csdn.net/qq_64154426/article/details/124417429

版权

该博客展示了如何使用C语言实现顺序表的初始化、插入和删除操作。代码包括了初始化函数sequentialListInit、插入函数sequentialListInsert和删除函数sequentialListDelete，并通过测试函数进行了功能验证。在插入和删除过程中，程序会检查边界条件并给出相应的错误提示。

摘要由CSDN通过智能技术生成

1.代码

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

#define LIST_MAX_LENGTH 10

typedef struct SequentialList {
int actualLength;

int data[LIST_MAX_LENGTH];

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 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");

   outputMemory(tempList);
}

void main() {
   sequentialInsertTest();
   sequentialDeleteTest();
}

运行结果

After initialization, the list is: 3 5 2 7 4
Now insert to the first, the list is: 8 3 5 2 7 4
Now insert to the last, the list is: 8 3 5 2 7 4 9
Now insert beyond the tail.
Cannot insert element: the position 8 is bigger than the list length 7.
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
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. ----
The address of the structure: 10163840
The address of actualLength: 10163840
The address of data: 10163844
The address of actual data: 10163844
The address of second data: 10163848
Press any key to continue

typedef struct SequentialList {
   int data[LIST_MAX_LENGTH];

   int actuallength;
} *SequentialListPtr;

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

void outputMemory(SequentialListPtr paraListPtr) {
   printf("The address of the structure:%p\n", paraListPtr);
   printf("The address of actuallength:%p\n", &paraListPtr->actuallength);
   printf("The address of data:%p\n", &paraListPtr->data);
   printf("The address of first data:%p\n", &paraListPtr->data[0]);
   printf("The address of second data:%p\n", &paraListPtr->data[1]);
}

SequentialListPtr sequentialListInit(int paraData[], int paraLength) {
   SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));
   int i;
   for (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.\n");
       return;
   }

   if (paraPosition < 0) {
       printf("Cannot insert element: negative position unsupported.\n");
       return;
   }

   if (paraPosition > paraListPtr->actuallength) {
       printf("Cannot insert element: the position %d is bigger than the list length %d.\n", paraPosition, paraValue);
       return;
   }

   int i;
   for (i = paraListPtr->actuallength; i > paraPosition; i --) {
       paraListPtr->data[i] = paraListPtr->data[i - 1];
   }

   paraListPtr->data[paraPosition] = paraValue;

   paraListPtr->actuallength ++;
}

void sequentialListDelete(SequentialListPtr paraListPtr, int paraPosition) {
   if (paraPosition < 0) {
       printf("Invalid position: %d.\n", paraPosition);
       return;
   }

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

   int i;
   for (i = paraPosition; i < paraListPtr->actuallength; i ++) {
       paraListPtr->data[i] = paraListPtr->data[i + 1];
   }

   paraListPtr->actuallength --;
}