【数据结构】顺序表

顺序表是一种十分常用的数据结构。

顺序表的插入

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

#define LIST_MAX_LENGTH 10

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

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

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

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

		return resultPrt;
}

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

	//step2 :Position check
	if (paraPosition < 0)
	{
		printf("Cannot insert element: negative position unsupported.");
		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;
	}

	//step3 :Move the remaining part
	for (int i = paraListPtr->actualLength; i > paraPosition; i--)
	{
		paraListPtr->data[i] = paraListPtr->data[i - 1];
	}

	//step4 :Insert
	paraListPtr->data[paraPosition] = paraValue;

	//step5 :Updade 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);
	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);
	printf("The list is:");
	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 the position 3
	for (int i = 0; i < 5; i++)
	{
		printf("Inserting %d.\r\n", (i + 10));
		sequentialListInsert(tempList, 0, (i + 10));
		outputList(tempList);

		printf("---- sequentialInsertTest ends. ----\r\n");
	}
}

void main()
{
	sequentialInsertTest();
	
}

1.顺序表的插入操作时，如果规定了最大长度 ，那么一定在插入前要检查，检查是否超过了最大长度，检查插入位置是否合理。
2.插入分为头插，尾插，指定位置插入； 如果顺序表满了则不能再插入
3.malloc 分配的内存在堆区，free 释放分配的内存

顺序表的删除

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

#define LIST_MAX_LENGTH 10

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

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

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

}

SequentialListPtr sequentialListInit(int paraData[], int paraLength)
{
	SequentialListPtr resultPrt = (SequentialListPtr)malloc(sizeof(struct SequentialList));

	for (int i = 0; i < paraLength; i++)
	{
		resultPrt->data[i] = paraData[i];
	}
	resultPrt->actualLength = paraLength;

	return resultPrt;
}

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;
}

//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 (-6)th, the list is: ");
	sequentialListDelete(tempList, -6);
	outputList(tempList);

	printf("---- sequentialDeleteTest ends. ----\r\n");

	
}




void main()
{
	sequentialDeleteTest();
	
}

1.删除时也要注意检查位置是否合理
2.无论是插入还是删除，都要记得更新顺序表的长度

顺序表查找位置

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

顺序表按位置读取元素

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 clearList(SequentialListPtr paraListPtr) 
{
	paraListPtr->actualLength = 0;
}// Of clearList

地址打印

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