数据结构01-线性表

一.老师的代码

#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

二.我的代码：

1.输入顺序表

void output(sqLPtr L){
	for(int i = 0;i < L->Length;i++){
		printf("%d ",L->data[i]);
	}
	printf("\n");
}

2.输出地址

void outputMemory(sqLPtr LPtr){
		printf("链表的地址:%ld\n",LPtr);
		printf("链表长度的地址:%ld\n",&LPtr->Length);
		printf("数据数组的地址:%ld\n",&LPtr->data);
		printf("第一个数据的地址:%ld\n",&LPtr->data[0]);
		printf("第二个数据的地址:%ld\n",&LPtr->data[1]);
} 

3.顺序表初始化

sqLPtr sqLIni(int Data[],int pLength){
	sqLPtr iniL = (sqLPtr)malloc(sizeof(sqL));
	for(int i = 0;i < pLength;i++){
		iniL->data[i] = Data[i];
	}
	iniL->Length = pLength;
	return iniL;
}

4.插入元素

void sqLInsert(sqLPtr psqL,int pos,int value){
	//检查是否空间已满 
	if(psqL->Length >= MAXLENGTH){
		printf("空间已满!");
		return;
	}
	//检查位置是否合法 
	if(pos < 0 || pos > psqL->Length){
		printf("位置不合法！");
		return; 
	}
	for(int i = psqL->Length;i > pos;i--){
		psqL->data[i] = psqL->data[i-1];
	}
	
	psqL->data[pos] = value;
	psqL->Length++;
}

5.插入测试

void inserttest(){
	int i;
	int a[5] = {2,5,7,4,6};
	
	printf("---- 插入测试开始 ----\n");
	
	//初始化
	sqLPtr tempL = sqLIni(a,5);
	printf("初始化结果: "); 
	output(tempL);
	
	//插入
    printf("插入第一个: ");
	sqLInsert(tempL, 0, 8);
	output(tempL);

    printf("插入最后一个: ");
	sqLInsert(tempL, 6, 9);
	output(tempL);

    printf("插入超过最后一个\n");
	sqLInsert(tempL, 8, 9);
    printf("\nThe list is:");
	output(tempL);

	for (i = 0; i < 5; i ++) {
		printf("插入 %d.\n", (i + 10));
		sqLInsert(tempL, 0, (i + 10));
		output(tempL);
	}
    printf("----插入结束----\n");
} 

6.删除元素

int sqLDelete(sqLPtr psqL,int pos){
	if(pos < 0 || pos >= psqL->Length){
		printf("无法删除：位置不合法!");
		return-1;
	}
	
	int deletevalue = psqL->data[pos];
	for(int i = pos; i < psqL->Length;i++){
		psqL->data[i] = psqL->data[i+1];
	}
	psqL->Length--;
	return deletevalue;
}

7.删除测试

void deletetest(){
	int i;
	int a[5] = {2,5,7,4,6};
	
 	printf("----删除测试开始----\n");
	//初始化
	sqLPtr tempL = sqLIni(a,5);
	printf("初始化结果: "); 
	output(tempL);
	
    printf("删除第一个: ");
	sqLDelete(tempL, 0);
	output(tempL);

    printf("删除最后一个: ");
	sqLDelete(tempL, 3);
	output(tempL);

    printf("删除第二个: ");
	sqLDelete(tempL, 1);
	output(tempL);

    printf("删除第五个: ");
	sqLDelete(tempL, 5);
	output(tempL);


    printf("删除第-6个: ");
	sqLDelete(tempL, -6);
	output(tempL);

    printf("----删除测试结束----\n");

	outputMemory(tempL);
} 

8.定位

int locate(sqLPtr psqL,int value){
	for(int i = 0;i < psqL->Length;i++){
		if(psqL->data[i] == value){
			return i;
		}
	}
	return -1;
}

9.查找

int get(sqLPtr psqL, int pos){
    if (pos < 0 || pos >= psqL->Length) {
        printf("无法找到：不合法位置");
        return -1;
    }
	return psqL->data[pos];
}

10.求前一个

int prior(sqLPtr psqL,int pos){
	if(pos <=0 || pos > psqL->Length){
		printf("无法找到：不合法位置");
        return -1;
	}
	return psqL->data[pos-1];
}

11.清空

void clear(sqLPtr psqL) {
	psqL->Length = 0;
}

12.完整代码如下

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

#define MAXLENGTH 10

//创建结构体
typedef struct sqL{
	int Length;
	int data[MAXLENGTH];
}*sqLPtr;

//输出顺序表 
void output(sqLPtr L);
//输出地址
void outputMemory(sqLPtr LPtr);
//顺序表初始化
sqLPtr sqLIni(int Data[],int pLength);
//插入元素 
void sqLInsert(sqLPtr psqL,int pos,int value);
//插入测试
void inserttest();
//删除元素 
int sqLDelete(sqLPtr psqL,int pos);
//删除测试
void deletetest();
//定位 
int locate(sqLPtr psqL,int value);
//查找 
int get(sqLPtr psqL, int pos) ;
//清空 
void clear(sqLPtr psqL);
//求前一个 
int prior(sqLPtr psqL,int pos); 

int main(){
	inserttest();
	deletetest(); 
	return 0;
}

//输出顺序表 
void output(sqLPtr L){
	for(int i = 0;i < L->Length;i++){
		printf("%d ",L->data[i]);
	}
	printf("\n");
}

//输出地址
void outputMemory(sqLPtr LPtr){
		printf("链表的地址:%ld\n",LPtr);
		printf("链表长度的地址:%ld\n",&LPtr->Length);
		printf("数据数组的地址:%ld\n",&LPtr->data);
		printf("第一个数据的地址:%ld\n",&LPtr->data[0]);
		printf("第二个数据的地址:%ld\n",&LPtr->data[1]);
} 

//顺序表初始化
sqLPtr sqLIni(int Data[],int pLength){
	sqLPtr iniL = (sqLPtr)malloc(sizeof(sqL));
	for(int i = 0;i < pLength;i++){
		iniL->data[i] = Data[i];
	}
	iniL->Length = pLength;
	return iniL;
}

//插入元素 
void sqLInsert(sqLPtr psqL,int pos,int value){
	//检查是否空间已满 
	if(psqL->Length >= MAXLENGTH){
		printf("空间已满!");
		return;
	}
	//检查位置是否合法 
	if(pos < 0 || pos > psqL->Length){
		printf("位置不合法！");
		return; 
	}
	for(int i = psqL->Length;i > pos;i--){
		psqL->data[i] = psqL->data[i-1];
	}
	
	psqL->data[pos] = value;
	psqL->Length++;
}

//插入测试
void inserttest(){
	int i;
	int a[5] = {2,5,7,4,6};
	
	printf("---- 插入测试开始 ----\n");
	
	//初始化
	sqLPtr tempL = sqLIni(a,5);
	printf("初始化结果: "); 
	output(tempL);
	
	//插入
    printf("插入第一个: ");
	sqLInsert(tempL, 0, 8);
	output(tempL);

    printf("插入最后一个: ");
	sqLInsert(tempL, 6, 9);
	output(tempL);

    printf("插入超过最后一个\n");
	sqLInsert(tempL, 8, 9);
    printf("\nThe list is:");
	output(tempL);

	for (i = 0; i < 5; i ++) {
		printf("插入 %d.\n", (i + 10));
		sqLInsert(tempL, 0, (i + 10));
		output(tempL);
	}
    printf("----插入结束----\n");
} 

//删除元素 
int sqLDelete(sqLPtr psqL,int pos){
	if(pos < 0 || pos >= psqL->Length){
		printf("无法删除：位置不合法!");
		return-1;
	}
	
	int deletevalue = psqL->data[pos];
	for(int i = pos; i < psqL->Length;i++){
		psqL->data[i] = psqL->data[i+1];
	}
	psqL->Length--;
	return deletevalue;
}

//删除测试
void deletetest(){
	int i;
	int a[5] = {2,5,7,4,6};
	
 	printf("----删除测试开始----\n");
	//初始化
	sqLPtr tempL = sqLIni(a,5);
	printf("初始化结果: "); 
	output(tempL);
	
    printf("删除第一个: ");
	sqLDelete(tempL, 0);
	output(tempL);

    printf("删除最后一个: ");
	sqLDelete(tempL, 3);
	output(tempL);

    printf("删除第二个: ");
	sqLDelete(tempL, 1);
	output(tempL);

    printf("删除第五个: ");
	sqLDelete(tempL, 5);
	output(tempL);


    printf("删除第-6个: ");
	sqLDelete(tempL, -6);
	output(tempL);

    printf("----删除测试结束----\n");

	outputMemory(tempL);
} 

//定位 
int locate(sqLPtr psqL,int value){
	for(int i = 0;i < psqL->Length;i++){
		if(psqL->data[i] == value){
			return i;
		}
	}
	return -1;
}

//查找 
int get(sqLPtr psqL, int pos){
    if (pos < 0 || pos >= psqL->Length) {
        printf("无法找到：不合法位置");
        return -1;
    }
	return psqL->data[pos];
}

//求前一个 
int prior(sqLPtr psqL,int pos){
	if(pos <=0 || pos > psqL->Length){
		printf("无法找到：不合法位置");
        return -1;
	}
	return psqL->data[pos-1];
}

//清空 
void clear(sqLPtr psqL) {
	psqL->Length = 0;
}

13.运行结果

---- 插入测试开始 ----
初始化结果: 2 5 7 4 6
插入第一个: 8 2 5 7 4 6
插入最后一个: 8 2 5 7 4 6 9
插入超过最后一个
位置不合法！
The list is:8 2 5 7 4 6 9
插入 10.
10 8 2 5 7 4 6 9
插入 11.
11 10 8 2 5 7 4 6 9
插入 12.
12 11 10 8 2 5 7 4 6 9
插入 13.
空间已满!12 11 10 8 2 5 7 4 6 9
插入 14.
空间已满!12 11 10 8 2 5 7 4 6 9
----插入结束----
----删除测试开始----
初始化结果: 2 5 7 4 6
删除第一个: 5 7 4 6
删除最后一个: 5 7 4
删除第二个: 5 4
删除第五个: 无法删除：位置不合法!5 4
删除第-6个: 无法删除：位置不合法!5 4
----删除测试结束----
链表的地址:12937952
链表长度的地址:12937952
数据数组的地址:12937956
第一个数据的地址:12937956
第二个数据的地址:12937960

--------------------------------
Process exited after 0.008265 seconds with return value 0