数据结构—顺序表

目录

一、老师的代码

#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("\r\n");
}// Of outputList

/**
 * Output the memeory for the list.
 */
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]);
}// 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.\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) {
	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.\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

	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

二、自己的代码

一、头文件

二、顺序表的结构

三、输出顺序表

四、初始化顺序表

五、插入元素

六、指定位置删除元素

七、按值查找

八、按位置查找

九、清空顺序表

十、求顺序表表长

十一、求前驱

一、头文件

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

#define MAXSIZE 10

二、顺序表的结构

typedef struct List{
	int data[MAXSIZE];
	int length;
}*SqList;

三、输出顺序表

//输出
void outputList(SqList L){ 
	int i;
	for(i=0;i<L->length;i++)
	{
		printf("%d ",L->data[i]);
	}
	printf("\n");
}

四、初始化顺序表

//初始化 
SqList InitList(int paraData[], int paraLength){
	int i;
	SqList resultPtr=(SqList)malloc(sizeof(struct list));//动态分配内存 
	for(i=0;i<paraLength;i++)
	{
		resultPtr->data[i]=paraData[i];//对线性表数据进行赋值 
	}
	resultPtr->length=paraLength;//对线性表的长度进行赋值 
	printf("\n");
	return resultPtr;//返回线性表 
}

五、插入元素

//插入元素
void InsertList(SqList L, int paraPosition, int paraData){
	//判断线性表长度是否大于或等于最大长度
	if(L->length >= MAXSIZE)
	{
		printf("Cannot inset element:the list is full");
		return;	
	} 
	//判断插入位置是否合法 
	if(paraPosition<0)
	{
		printf("Cannot insert element:negative position unsupposed");
		return;
	}
	if(paraPosition > L->length )
	{
		printf("Cannot insert element:the position %d is bigger than the list length %d.\r\n",paraPosition,L->length);
		return;
	} 
	//移动元素 
	int i=L->length;
	for(;i>paraPosition;i--)
	{
		L->data [i]=L->data [i-1];//
	}
	//插入 
	L->data [i]=paraData;
	L->length++;//长度更新 
} 

六、指定位置删除元素

//指定位置对元素进行删除
int deleteList(SqList L, int paraPosition)
{
	//判断删除位置是否合理
	if(paraPosition<0)
	{
		printf("Invalid position:%d\n",paraPosition);
		return -1;
	} 
	if(paraPosition>L->=length )
	{
		printf("Cannot delete element:the position %d is bigger than the list length %d.\r\n",paraPosition,L->length )
		return -1;
	}
	//删除元素
	int i=paraPosition;
	int Value=L->data [paraPosition]; 
	for(;i<SqList->length;i++)//直接覆盖要删除的元素，同时后面的元素向前移动一位 
	{
		L->data [i]=L->data [i+1];
	} 
	L->length --;//更新长度 
	return Value;//返回被删除的元素的值 
}

七、按值查找

//按值查找 
int locatelemenByValue(SqList L,int paraData)
{
	int i=0;
	for(;i<L->length,i++)
	{
		if(L->data [i]==paraData);
		return i;
	}
	return -1;
}

八、按位置查找

//按位置查找
int locatelementByPosition(SqList L,int paraPosition)
{
	//判断位置是否合理
	if(paraPosition<0)
	{
		printf("Cannot locate the element:Invalid position %d.\n",paraPosition);
		return -1;
	}
	if(paraPosition>L->length)
	{
		printf("Cannot locate the element:the position %d is bigger than the list length %d.\r\n",paraPosition,L->length);
		return -1;
	 } 
	return L->data [paraPosition-1];//直接返回对应位置的元素 
}

九、 清空顺序表

//清空顺序表
void ClearList(SqList L)
{
	L->length =0;//直接将长度设置为0;
	return ; 
 } 

十、求顺序表表长

//清空顺序表
void ClearList(SqList L)
{
	L->length =0;//直接将长度设置为0;
	return ; 
 } 

十一、求前驱

//求前驱
int ListPrior(SqList L, int paraPosition)
{
	//判断位置是否合法 
	if(paraPosition<=0||paraPosition>L->length)
	{
		printf("Invalid paraPosition! %d\n",paraPosition);
		return -1;
	}
	else if(paraPosition==1)
	{
		printf("第一个元素没有直接前驱");
		return -1;
	}
	else
	{
		printf("第%d个元素的直接前驱为%d\n",paraPosition,L->data [paraPosition-2]);
		return ;
	}
 }