线性表的顺序存储结构的基本操作

1线性表的定义

线性表是具有相同特性的数据元素的一个有限序列

a1（线性起点）,a2,a3......an（线性终点）n为元素总个数（n=0时为空表） 除开第一个元素或最后一个元素外都有一个直接前驱与直接后继。

2.线性表的顺序表示和实现

线性表的顺序表示又称为顺序存储结构或顺序映像

顺序存储定义：把逻辑上相邻的数据元素存储在物理上相邻的存储单元中的存储结构

3.顺序表的基本操作及完整代码

a.顺序表的定义

//创建一个线性表
#define MAXSIZE 10
typedef struct SequentiaList{
	int data[MAXSIZE];
	int actuallength;
}SequentiaList; 

b.顺序表的初始化

void  InitList (SequentiaList *paralist)
{
	paralist->data=(int*)malloc(sizeof(int)*MAXSIZE);
	int i;
	paralist->actuallength=0;
	return L;
}

c.创造一个线性表

SequentiaList createList(SequentiaList *paralist,int str[],int n)
{
	if(n>MAXSIZE)
	{
		printf("NOT enougth space to allocata")//空间分配存在问题
		return 0; 
	}
	int j;
	for(j=0;j<n;j++)
	{
		paralist->data[j]=a[j];
	}
	paralist->length=n;
	return 1;
 } 

d.销毁线性表

//销毁线性表 
void DestroyList(SequentiaList *paralist)
{
	if(paralist->actuallength==0)
	{
		printf("This list is empty");
	}
	if(paralist->data)//线性表存在 
	{
		paralist->data=NULL;
	}
	paralist->actuallength=0;//销毁成功 
}

e.清空线性表

//清空线性表
void ClearList(SequentiaList *paralist)
{
	paralist->actuallength=0;//让线性表长度为零 
 } 

f.求线性表长度

//求线性表长度
 int LengthList(SequentiaList *paralist)
{
 	return paralist->length;
} 

g.判断线性表是否为空

//判断是否为空 
int Isempty(Sqlist *paralist)
{
	if(paralist->actuallength==0)
	return 1;
	else
	return 0;
}

h.获取线性表某个位置的数

//获取线性表某个位置的数
int GetElem(SequentiaList *paralist,int i)
{
	int e;
	if(i<=paralist->actuallength&&i>0)//如果位置合理
	{
	e=paralist->data[i-1];
	return e;
   }
   else
   return 0;//illegal position
 } 

i.按值查找

//按值查找 
int LocateElem(SequentiaList paralist,int e)
{
	int i;
	for(i=0;i<paralist.actuallength;i++)
	{
		if(paralist.data[i]==e)
		return i+1;
	}
	else
	return 0;//查找失败 
 } 

j.按位查找

//按位置查找
 int LocateElem(SequentiaList paralist,int i)
 {
 	if(i<paralist.actuallength)
 	return paralist->data[i-1];
  } 

k.插入元素

//插入元素
  void InsertElem(SequentiaList *paralist,int i,int e)//在第I个位置插入元素 
  {
  	int j=0;
  	if(i<1||i>paralist->actuallength)//插入位置非法 
    return 0;
    if(paralist->actuallength>MAXSIZE)//数组长度已满 
    return 0;
    for(j=paralist->actuallength;j>=i;j--)
    {
    	paralist->data[j]=paralist->data[j-1];//剩下元素后移 
	}
	paralist->data[i-1]=e;
	paralist->actuallength++;`
   } 

l.删除一个元素

//删除一个元素
 void DeleteList(SequentiaList *paralist,int i)
 {
 	int j=0;
 	if(i<1||i>paralist->actuallength)
 	return 0;
 	if(paralist->actuallength>MAXSIZE)
 	return 0;
 	for(j=i;j<paralist->actuallength;j++)
 	{
 		paralist->data[j-1]=L->data[j];//被删除元素前移 
	 }
	 paralist->actuallength--;
  } 

m.获得前驱元素

//获得前驱元素 
 int preNumber(SequentiaList *paralist,int i)
 {
 	if(i>paralist->length&&i<1)//位置非法,超越长度或第一个元素没有前驱 
 	{
	 printf("illegal positionn");
	 return 0;
    }
	 else
	 return paralist->data[i-2]; 
 }

n.获得后继元素

//获得后继元素 
 int nextNumber(SequentiaList *paralist,int i)
 {
 	if(i>paralist->length){//超越长度或最后一个位置没有后继元素 
 	printf("illegal positionn");
 	return 0;
  }
  else
  return paralist->data[i];
 }

完整代码

#include <stdio.h>
#include <malloc.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.
 */
void outputList(SequentialListPtr paraList) {
    for(int i = 0; i < paraList->actualLength; i ++) {
        printf("%d ", paraList->data[i]);
    }// Of for i
    printf("rn");
}// Of outputList

/**
 * Output the memeory for the list.
 */
void outputMemory(SequentialListPtr paraListPtr) {
    printf("The address of the structure: %ldrn", paraListPtr);
    printf("The address of actualLength: %ldrn", &paraListPtr->actualLength);
    printf("The address of data: %ldrn", &paraListPtr->data);
    printf("The address of actual data: %ldrn", &paraListPtr->data[0]);
    printf("The address of second data: %ldrn", &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.
 * @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

/**
 * 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.rn");
        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.rn", 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. ----rn");

	// 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. rn");
	sequentialListInsert(tempList, 8, 9);
    printf("The list is:");
	outputList(tempList);

	// Insert to position 3.
	for (i = 0; i < 5; i ++) {
		printf("Inserting %d.rn", (i + 10));
		sequentialListInsert(tempList, 0, (i + 10));
		outputList(tempList);
	}//Of for i

    printf("---- sequentialInsertTest ends. ----rn");
}// 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.rn", paraPosition);
        return -1;
    }//Of if

    if (paraPosition >= paraListPtr->actualLength) {
        printf("Cannot delete element: the position %d is beyond the list length %d.rn", 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. ----rn");

	// 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. ----rn");

	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.rn", paraPosition);
        return -1;
    }//Of if

    if (paraPosition >= paraListPtr->actualLength) {
        printf("Cannot delete element: the position %d is beyond the list length %d.rn", 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

最后

以上就是忧心面包为你收集整理的线性表的顺序存储结构的基本操作的全部内容，希望文章能够帮你解决线性表的顺序存储结构的基本操作所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。