数据结构第一次作业

1，代码

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

#define LIST_MAX_LENGTH 10

/**
 * linear list of intergers. The key is data.
 */
typedef struct SequentialList {
	int actualLength;
	
	int data[LIST_MAX_LENGTH];//The maxinum 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 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 fuction.
  * @param paraListPtr The painter to the list. It must be a painter to change the list.
  * @param paraValues An itn 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

/**
 * Tnsert an element into a sequential linear List.
 * @param paraListPtr The pointer to thelist. It must be a pointer to change the ;ist.
 * @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. Sepace 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: negative popsitive position unsupported.");
		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 fuction.
   */
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 changethe 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 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
	
	//steo 3. update the length.
	paraListPtr->actualLength --;
	
	// step 4. Return the length.
	return resultValue;
 }// of sequentialListDelete
 
 /**
  * Test the delete fuction.
  */
void sequentialDeleteTest() {
	int tempArray[5] = {3, 5, 2, 7, 4};
	
	printf("--- sequentialDeleteTest begins. ---\r\n");
	
	//Tnitialize.
	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 to the second.
	printf("Now delete the second, the list is: ");
	sequentialListDelete(tempList, 1);
	outputList(tempList);
	
	// Delete to the second.
	printf("Now delete the 5th, the list is: ");
	sequentialListDelete(tempList, 5);
	outputList(tempList);
	
	// Delete to 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 get element: the position %d is beyond the liost 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

2，结果