数据结构作业

#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];
} *SequentialListPtr;

//output the list

void outputList (SequentialListPtr paralist){  //遍历输出链表 
    for(int i=0; i<paralist->actualLength ;i++){
        printf("%d ",paralist->data[i]);
	}
	printf(" \r\n");
} 

//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]);
	
}


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];
	}
	resultPtr->actualLength = paraLength;
	
	return resultPtr;
}

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;
	}
	//step 2: position check 检查位置是否正确 
	if(paraPosition<0){
		printf("Cannot insere element: negative position unsupported.\r\n");
		return;
	}
	if(paraPosition>paraListPtr->actualLength){ //插入位置越界，不可以插入 
		printf("Cannot insert element:the position %%d id bigger than the list length %d.\r\n",paraPosition, paraListPtr->actualLength);
	    return;
	}
	
	//step 3:move the remaining part. 移动越界数据 
	for(int i=paraListPtr->actualLength;i>paraPosition;i--){
		paraListPtr->data[i]=paraListPtr->data[i-1];
	}
	
	//step 4: Insert.
	paraListPtr->data[paraPosition]=paraValue;  //插入数据 
	
	//step 5: update the length
	paraListPtr->actualLength ++;  //更新链表长度 
}

//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);//初始化一个链表（长度为5） 
	printf("After initialization, the list is: \n");
	outputList(tempList);
	
	//Insert to  the first
	printf("Now insert to the first, the list is: \n");
	sequentialListInsert(tempList, 0, 8);
	outputList(tempList);
	
	//Insert to the last.
	printf("Now insert to the last, the list is: \n");
	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:\n");
	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);
	}
	
	printf("---- sequentialInsertTest ends. ----\r\n");
	
}


int sequentialListDelete(SequentialListPtr paraListPtr, int paraPosition){ //数据的删除 
	//step 1. Position check.
	if (paraPosition < 0 ){ //位置不合理 
		printf("Invalid position: %d.\r\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;
	}
	
	//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]; //删除数据 依次覆盖前一个元素 
		
	} 
	
	//step 3. Update the Length
	paraListPtr->actualLength --; //减少长度 
	
	//step 4.Return the value.
	return resultValue; //返回被删除的数据 
}

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:\n");
	outputList(tempList);
	
	//Delete the first.
	printf("Now delete the first, the list is：\n");
	sequentialListDelete(tempList, 0);
	outputList (tempList); 
	
	// Delete to the last.
    printf("Now delete the last, the list is: ");
	sequentialListDelete(tempList, 3);
	outputList(tempList);

	
	//Delete to the last.
	printf("Now delete the last, the list is: \n");
	sequentialListDelete(tempList,1);
	outputList(tempList);
	
	//Delete the second.
	printf("Now delete the 5th, the list is: \n");
	sequentialListDelete(tempList, 5);
	outputList (tempList);
	
	//Delete the second
	printf("Now delete the (-6)th, the list is: \n");
	sequentialListDelete(tempList,-6);
	outputList(tempList);
	
	printf("---- sequentialDeleteTest ends. ----\r\n");
	
	outputMemory (tempList);
}
 
int locateElement(SequentialListPtr paraListPtr, int paraValue){ //查找数据 
	for(int i=0; i<paraListPtr->actualLength;i++){
		if(paraListPtr->data[i] == paraValue){
			return i;  //返回数据所在位置 
		}
	}
	return -1;
	
}

int getELement(SequentialListPtr paraListPtr, int paraPosition){
	//step 1. Position check.
	if(paraPosition <0){ //位置不合法 
		printf("Invalid position: %d. \r\n",paraPosition);
		return -1;
	}
	
	if(paraPosition >= paraListPtr->actualLength){ //超过链表长度 
		printf("Cannot get element: the position %d is beyond the list length %d.\r\n",paraPosition,paraListPtr->actualLength);
		return -1;
	}
	
	return paraListPtr->data[paraPosition]; //返回此处位置所存储的数据 
}

void cleatList(SequentialListPtr paraListPtr){
	paraListPtr->actualLength = 0; //清空链表长度 
}

int main(){
	sequentialInsertTest();
	sequentialDeleteTest();
}

运行结果

心得体会：了解了链表的增删等基本操作，自己动手抄了一遍也发现了自己存在的一些问题。代码主要采用函数形式，在修改方面也很容易，学到了一些代码的编写思路