数据结构-顺序表

        顺序表是在计算机中以数组的形式保存的线性表，线性表的顺序存储是指用一组地址连续的存储单元依次存储线性表中的各个元素、使得线性表中在逻辑结构上相邻的数据元素存储在相邻的物理存储单元中，即通过数据元素物理存储的相邻关系来反映数据元素之间逻辑上的相邻关系，采用顺序存储结构的线性表通常称为顺序表。顺序表是将表中的结点依次存放在计算机内存中一组地址连续的存储单元中

1.定义顺序表

typedef struct SequentialList {
 	int actualLength;
 	
 	int data[LIST_MAX_LENGTH];
} *SequentialListPtr;

2.打印顺序表

void outputList(SequentialListPtr paraList){
	for(int i = 0;i < paraList->actualLength;i++){
		printf(" %d",paraList->data[i]);
	}
	printf("\r\n");
}

3.顺序表地址

void outputMemeory(SequentialListPtr paraListPtr){
	printf("The address of the structure: %ld\r\n",paraListPtr);
	printf("The address of the actualLength: %ld\r\n",&paraListPtr->actualLength);
	printf("The address of the data:%ld\r\n",&paraListPtr->data);
	printf("The address of the actual data: %ld\r\n",&paraListPtr->data[0]);
	printf("The address of the second data: %ld\r\n",&paraListPtr->data[1]);
}

4.初始化

SequentialListPtr sequentialListInit(int paraData[],int paraLength){
	SequentialListPtr resultPtr = (SequentialList*)malloc(sizeof(SequentialList));
	for (int i = 0;i < paraLength;i ++){
		resultPtr->data[i] = paraData[i];
	}
	resultPtr->actualLength = paraLength;
	
	return resultPtr;
}

5.插入新元素

将需要插入位置之后的元素整体向后移动一个位置，用新元素覆盖该位置

void sequentialListInsert(SequentialListPtr paraListPtr,int paraPosition,int paraValue){
	if(paraListPtr->actualLength >= LIST_MAX_LENGTH){
		printf("Cannot insert element:list full.\r\n");
		return;
	}

	if(paraPosition>paraListPtr->actualLength){
		printf("Cannot insert element:the position %d is bigger than the list length %d.\r\n",paraPosition,paraListPtr->actualLength);
		return;
	}

	for (int i = paraListPtr->actualLength;i > paraPosition;i--){
		paraListPtr->data[i] = paraListPtr->data[i-1];
	}

	paraListPtr->data[paraPosition] = paraValue;

	paraListPtr->actualLength ++;
}

6.插入测试

void sequentialInsertTest(){
	int i;
	int tempArray[5] = {3,5,2,7,4};
	
	printf("----sequentialInsertTest begins.----\r\n");

	SequentialListPtr tempList =  sequentialListInit(tempArray,5);
	printf("After initialization,the list is：");
	outputList(tempList);

	printf("Now insert to the first,the list is:");
	sequentialListInsert(tempList,0,8);
	outputList(tempList);

	printf("Now insert to the last,the list is:");
	sequentialListInsert (tempList,6,9);
	outputList(tempList);

	printf("Now insert beyond the tail.\r\n");
	sequentialListInsert (tempList,8,9);
	printf("The list is:");
	outputList(tempList);
	
	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");
}

7.删除元素

int sequentialListDelete(SequentialListPtr paraListPtr,int paraPosition){
	if(paraPosition < 0){
		printf("Invalid position:%d.\r\n",paraPosition);
		return -1;
	}
	
	if(paraPosition >= paraListPtr->actualLength){
		printf("Cannot delet element:the position %d is beyond the list length %d.\r\n",paraPosition,paraListPtr->actualLength);
		return -1;
	}

	int resultValue = paraListPtr->data[paraPosition];
	for(int i = paraPosition;i < paraListPtr->actualLength;i++){
	paraListPtr->data[i] = paraListPtr->data[i+1];
	}

	paraListPtr->actualLength --;

	return resultValue;
}

8.删除测试

void sequtialDeleteTest(){
	int tempArray[5] = {3,5,2,7,4};
	
	printf("----sequtialDeleteTest begins.----\r\n");

	SequentialListPtr tempList = sequentialListInit(tempArray,5);
	printf("After initialization,the list is:");
	outputList(tempList);

	printf("Now delete the first,the list is:");
	sequentialListDelete(tempList,0);
	outputList(tempList);

	printf("Now delete the last,the list is:");
	sequentialListDelete(tempList,3);
	outputList(tempList);
	
	printf("Now delete the second,the list is:");
	sequentialListDelete(tempList,1);
	outputList(tempList);
	
	printf("Now delete the 5th,the list is:");
	sequentialListDelete(tempList,5);
	outputList(tempList);
	
	printf("Now delete the (-6)th,the list is:");
	sequentialListDelete(tempList,-6);
	outputList(tempList);
	
	printf("----sequtialDeleteTest ends.----\r\n");
	
	outputMemeory(tempList);
}

9.查找该位置的元素

int locateElement(SequentialListPtr paraListPtr, int paraValue) {
	for (int i = 0; i < paraListPtr->actualLength; i ++) {
		if (paraListPtr->data[i] == paraValue) {
			return i;
		}
	}

	return -1;
}

10.查找元素的位置

int getElement(SequentialListPtr paraListPtr, int paraPosition) {
    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;
    }

	return paraListPtr->data[paraPosition];
}

11.清空

void clearList(SequentialListPtr paraListPtr) {
	paraListPtr->actualLength = 0;
}

运行结果