第一次作业

1，代码

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

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) {
	if(paraListPtr->actualLength >=LIST_MAX_LENGTH){
		printf("Cannot insert element: list full.\r\n");
		return;
	}
	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;
    }
     for (int i = paraListPtr->actualLength; i > paraPosition; i --) {
        paraListPtr->data[i] = paraListPtr->data[i - 1];
    }
    paraListPtr->data[paraPosition] = paraValue;
    paraListPtr->actualLength ++;
}

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

int sequentialListDelete(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;
    }

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

 	paraListPtr->actualLength --;

	return resultValue;
}
void sequentialDeleteTest() {
	int tempArray[5] = {3, 5, 2, 7, 4};

    printf("---- sequentialDeleteTest 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("---- 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) {
    
    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;
}

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

2，结果

---- sequentialInsertTest begins. ----
After initialization, the list is: 3 5 2 7 4 
Now insert to the first, the list is: 8 3 5 2 7 4 
Now insert to the last, the list is: 8 3 5 2 7 4 9 
Now insert beyond the tail. 
Cannot insert element: the position 8 is bigger than the list length 7.
The list is:8 3 5 2 7 4 9 
Inserting 10.
10 8 3 5 2 7 4 9 
Inserting 11.
11 10 8 3 5 2 7 4 9 
Inserting 12.
12 11 10 8 3 5 2 7 4 9 
Inserting 13.
Cannot insert element: list full.
12 11 10 8 3 5 2 7 4 9 
Inserting 14.
Cannot insert element: list full.
12 11 10 8 3 5 2 7 4 9 
---- sequentialInsertTest ends. ----
---- sequentialDeleteTest begins. ----
After initialization, the list is: 3 5 2 7 4 
Now delete the first, the list is: 5 2 7 4 
Now delete the last, the list is: 5 2 7 
Now delete the second, the list is: 5 7 
Now delete the 5th, the list is: Cannot delete element: the position 5 is beyond the list length 2.
5 7 
Now delete the (-6)th, the list is: Invalid position: -6.
5 7 
---- sequentialDeleteTest ends. ----
The address of the structure:93860657436400
The address of the actualLength:93860657436400
The address of the data:93860657436404
The address of the actual data:5
The address of the second data:7