数据结构作业1--顺序表

自己写的代码本体

#include<stdio.h>
#include<stdlib.h>
//给变量起一个别名，方便后面修改
typedef int E;
typedef struct List * ArrList;
//创建结构体顺序表
struct List {
	E *arr;//数组当顺序表
	int capacity;//数组容量
	int size;//已存储的元素数量
};
//顺序表初始化
//变量顺序表
int initList(ArrList list)
{
	list->capacity = 10;
	list->arr = malloc(sizeof(E) * list->capacity);
	//判断申请空间是否成功
	if(list->arr==NULL)
	{
		return 0;
	}
	list->size = 0;
	return 1;
}
//顺序表插入元素
//变量顺序表，插入的元素，插入的位序
//时间复杂度O(n)
int insertList(ArrList list,E element,int index)
{
	//位序不合理插入失败
	if(index<1||index>list->size+1)
	{
		return 0;
	}
	//顺序表满了扩容
	if(list->capacity==list->size)
	{
		//变成原来的1.5倍
		//x>>1变成x的一半，x<<1变成x的一倍
		int newCapacity = list->capacity + (list->capacity>>1);
		E* newarr=realloc(list->arr,newCapacity*sizeof(E));
		if(newarr==NULL)
		{
			//扩容失败
		}
		else
		{
			//扩容成功
			list->arr=newarr;
			list->capacity=newCapacity;
		}
		
	}
	for(int i = list->size;i>=index;i--)
	{
		list->arr[i] = list->arr[i-1];
	}
	list->arr[index-1]=element;
	list->size++;
	return 1;
}
//顺序表删除元素
//变量顺序表，删除的位序
//时间复杂度O(n)
int deleteList(ArrList list,int index)
{
	//位序不符合删除失败
	if(index<1||index>list->size)
	{
		return 0;
	}
	for(int i = index-1;i<list->size-1;i++)
	{
		list->arr[i]=list->arr[i+1];
	}
	list->size = list->size--;
	return 1;
}
//获取顺序表长度
//变量顺序表
int sizeList(ArrList list)
{
	return list->size;
}
//获取顺序表位序元素
//变量顺序表，位序
//时间复杂度O(1)
int getList(ArrList list,int index)
{
	//位序不合理获取失败
	if(index<1||index>list->size)
	{
		return NULL;
		//获取失败
	}
	else
	{
		return list->arr[index-1];
	}
}
//寻找某个元素出现位置（多次找第一个）
//变量顺序表，要找的元素
int findList(ArrList list,E element)
{
	for(int i = 0;i<list->size;i++)
	{
		if(list->arr[i]==element)
		{
			return i+1;
		}
	}
	//没找到
	return -1;
}
void printList(ArrList list)
{
	for(int i = 0;i<list->size;i++)
	{
		printf("%d  ",*list->arr);
		list->arr++;
	}
}
int main()
{
	//创建一个顺序表
	struct List list;
	//顺序表初始化
	if(initList(&list))
	{
		//初始化成功
		printf("创建顺序表成功\n");
	}
	else
	{
		printf("创建顺序表失败，请查找原因\n");
		//初始化失败
	}
	//测试插入数据
	for(int i = 1;i<10;i++)
	{
		insertList(&list,i,i);
	}
	//打印链表
	printList(&list);
	//打印链表长度
	printf("%d",sizeList(&list));
	return 0;
}

运行结果

创建顺序表成功
1  2  3  4  5  6  7  8  9
9

老师给的代码

#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 get 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

运行结果

自己的代码功能

打印顺序表

顺序表初始化

顺序表插入元素

顺序表删除元素

获取顺序表长度

获取指定位序顺序表元素

寻找指定元素（有多个只找第一个）

一些逻辑示意图（感觉没必要手绘）

后记

代码说明基本都在注释里了，感觉不必多提。

代码是以前照着大佬半抄半写的，和老师给的代码还是有挺多不同，但是顺序表基本功能基本都实现了，应该算完成了吧💦

没有抄老师代码里的Tast函数，直接抄的老师代码运行有Bug,地址用%p来写可能更好一点，VS里%ld报错了。但是逻辑关系还是能看懂。

老师关于顺序表的帖子写的很详细，评论区也有大佬指正代码问题，值得看看。