文章目录
线性表的顺序存储
这里是数据结构个人学习的笔记记录,如有问题欢迎指正说明
线性表的定义
线性表的顺序存储结构,指的就是用一段地址连续的存储单元一次存储线性表的数据元素。
顺序存储的相关操作实现
基本结构体
typedef struct SequentialList
{
int actualLength;
int data[LIST_MAX_LENGTH]; //The maximum length is fixed.
} *SequentialListPtr;
初始化
/* 初始化 */
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];
}// Of for i
resultPtr->actualLength = paraLength;
return resultPtr;
}//Of sequentialListInit
依次对线性表的每个数据元素输出
/* 依次对L的每个数据元素输出 */
void outputList(SequentialListPtr paraList)
{
for(int i=0;i<paraList->actualLength;i++)
SequentialListVisit(paraList->data[i]);
printf("\r\n");
}
返回线性表中元素的个数
/* 返回L中数据元素个数 */
int SequentialListLength(SequentialListPtr paraList)
{
return paraList->actualLength;
}
在线性表中指定位置之前插入新的数据元素,线性表的长度加1
/* 在线性表中指定位置之前插入新的数据元素,线性表的长度加1 */
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
删除线性表的指定位置的数据元素
/* 删除线性表的指定位置的数据元素 */
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
返回线性表中第一个与paraValue满足关系的数据元素的位序
/* 返回线性表中第一个与paraValue满足关系的数据元素的位序。 */
int locateElement(SequentialListPtr paraListPtr, int paraValue)
{
int i;
if(paraListPtr->actualLength==0)
return -1;
for (i = 0; i < paraListPtr->actualLength; i ++)
{
if (paraListPtr->data[i] == paraValue)
{
break;
}// Of if
}//Of for i
if(i>=paraListPtr->actualLength)
return -1;
return i+1;
}// Of locateElement
返回指定位置的值
/* 返回指定位置的值 */
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<0)
{
printf("Cannot delete element: the position %d is invalid\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;
}//Of if
return paraListPtr->data[paraPosition];
}// Of locateElement
将线性表重置为空表
/*将线性表重置为空表 */
void clearList(SequentialListPtr paraListPtr)
{
paraListPtr->actualLength = 0;
}// Of clearList
将所有的在线性表ListB中但不在ListA中的数据元素插入到ListA中
/**
* Insert all data elements in the linear table Listb but not in listA into listA
*/
void unionL(SequentialListPtr ListA,SequentialListPtr ListB)
{
int La_len,Lb_len,i;
int e;
La_len=SequentialListLength(ListA);
Lb_len=SequentialListLength(ListB);
for (i=0;i<Lb_len;i++)
{
e=getElement(ListB,i);
if (locateElement(ListA,e)==-1)
sequentialListInsert(ListA,La_len,e);
}
}
顺序存储的代码实现
#include<stdio.h>
#include<stdlib.h>
#define LIST_MAX_LENGTH 10
/**
* Linear list of integers. The key is data.
*/
typedef struct SequentialList
{
int actualLength;
int data[LIST_MAX_LENGTH]; //The maximum length is fixed.
} *SequentialListPtr;
/**
* Output the list.
*/
int SequentialListVisit(int i)
{
printf("%d ",i);
return 0;
}
void outputList(SequentialListPtr paraList)
{
for(int i=0;i<paraList->actualLength;i++)
SequentialListVisit(paraList->data[i]);
printf("\r\n");
}
/**
* Output the length of the list.
*
*/
int SequentialListLength(SequentialListPtr paraList)
{
return paraList->actualLength;
}
/**
* 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.
* @param paraValues An int array storing all elements.
*/
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];
}// Of for i
resultPtr->actualLength = paraLength;
return resultPtr;
}//Of sequentialListInit
/**
* Output the memeory for the list.
*/
void outputMemory(SequentialListPtr paraListPtr) {
printf("The address of the structure: %p\r\n", paraListPtr);
printf("The address of actualLength: %p\r\n", ¶ListPtr->actualLength);
printf("The address of data: %p\r\n", ¶ListPtr->data);
printf("The address of actual data: %p\r\n", ¶ListPtr->data[0]);
printf("The address of second data: %p\r\n", ¶ListPtr->data[1]);
}// Of outputMemory
/**
* 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.
* @param paraValue The value to be inserted.
*/
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 to 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 second.
printf("Now delete the 5th, the list is: ");
sequentialListDelete(tempList, 5);
outputList(tempList);
// Delete the second.
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)
{
int i;
if(paraListPtr->actualLength==0)
return -1;
for (i = 0; i < paraListPtr->actualLength; i ++)
{
if (paraListPtr->data[i] == paraValue)
{
break;
}// Of if
}//Of for i
if(i>=paraListPtr->actualLength)
return -1;
return i+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<0)
{
printf("Cannot delete element: the position %d is invalid\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;
}//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
/**
* Insert all data elements in the linear table Listb but not in listA into listA
*/
void unionList(SequentialListPtr ListA,SequentialListPtr ListB)
{
int La_len,Lb_len,i;
int e;
La_len=SequentialListLength(ListA);
Lb_len=SequentialListLength(ListB);
for (i=0;i<Lb_len;i++)
{
e=getElement(ListB,i);
if (locateElement(ListA,e)==-1)
sequentialListInsert(ListA,La_len,e);
}
}
/**
The entrance.
*/
void main() {
sequentialInsertTest();
sequentialDeleteTest();
}// Of main
样例测试输出
---- sequentialInsertTest begins. ----
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: 00000000001A6F50
The address of actualLength: 00000000001A6F50
The address of data: 00000000001A6F54
The address of actual data: 00000000001A6F54
The address of second data: 00000000001A6F58
顺序存储的优缺点
优点:可以快速地存取表中任一位置的元素
缺点:插入和删除需要移动大量的元素,难以确定存储空间的容量,存储空间“碎片”化
写在最后
欢迎移步另一篇我实现的不使用指针的写法
https://blog.csdn.net/AHuRui/article/details/124411736?utm_source=app&app_version=5.3.1