数据结构顺序表学习

  插入 1 空间检查 2 位置检查 3 将a[i] 从最后一个往后移一位 4 插入 5 重新计算长度

  删除 1 位置检查 2 将a[i]之前的数往后移一位 3 长度更新

#include<stdio.h>
#include<malloc.h>//malloc动态内存分配函数
 
# define LIST_MAX_LENGTH 10

/***Linear list of integers.The key is data.*/
typedef struct SquentialList{
	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 memory for the list.
*/
void outputMemory(SequentialListPtr paraListPtr){
	printf("The adress of the structure: %ld\r\n", paraListPtr);
	printf("The adress of actualLength: %ld\r\n", &paraListPtr->actualLength);
	printf("The adress of data: %ld\r\n", &paraListPtr->data);
	printf("The adress of actual data: %ld\r\n", &paraListPtr->data[0]);
	printf("The adress 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 SequentialListPtr));
	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.
 * @paramparaValue 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 > paraListPtr->actualLength) {
		printf("Cannot insert element: the position %d is bigger than list length %d.\r\n", paraPosition, paraListPtr->actualLength);
		return;
	}//of if
	
	// Step3. Move the remaining patr.
	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: ");
	sequentiaListInsert(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 nsert beyond the tail. \r\n");
	sequentialListInsert(tempList, 8, 9);
	printf("the list is:");
	out piutList(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 to change the list.
 * @param paraPosition The position, e.g., 0 stands for inserting at the first position.
 * @return The deleted value.
 */
int sequentia:istDelete(SequentialListPtr paraListPtr, int paraPosition) {
	// Step 1. Position check.
	if (paraPosition < 0) {
		printf("Invalid position: %d.\r\n, paraPosition");
		return -1;
	}//of if
	
	// Step 2. Move the remaining part.
	int resultValue = paraListPtr->data[paraPosition];
	for (int i = paraPosition; i < paraListPtr->actualLengh; 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 = sequentialListtInit(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);
	
	// Delet 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 paraListPtr->actualLength; i ++) {
		if (paraListPtr->data[i] == paraValue) {
			return i;
		}// 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("Invaild position: %d.\r\n, paraPosition");
		return -1;
	}// of if
	
	if (paraPosition >= paraListPtr->actualLength) {
		printf("Cannot get element: the position %d is beyond list length %d.\r\n", paraPosition, paraListPtr->actualLength);
		return -1;
	}// of if
	
	return paraListPtr->data[paraPosition];
}// of locateElement
/**
 * clear element in the list.
 * @param paraListPtr The pointer to the list.
 * @return The position of the value, or -1 indicating not exists
 */
void clearList(squentialListPtr paraListPtr) {
	paraListPtr->actualLength = 0;
}// of clearList

/**
 The entrance.
 */
void main() 
{
	sequentialInsertTest();
	sequentiaDeleteTest();
  }// of main