数据结构摘抄作业及收获

代码实现了一个固定长度的线性整数列表,包括初始化、输出列表、插入元素、删除元素等操作。在测试中展示了插入和删除的功能,强调了边界条件检查和列表满的情况。同时,输出了内存地址来理解数据结构在内存中的布局。
摘要由CSDN通过智能技术生成

一.摘抄代码如下 

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

#define LIST_MAX_LENGTH 10

/**
 * Linear list of integers. The key is data.
 */
 typedef struct SequentialList {
 	int actualLength;
 	
 	int data[LIST_MAX_LENGTH]; //The maximum length is fixed.
 } *SequentialListPtr;
 
 /**
  * Outout 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 memeory for the list.
   */
  void outputMemory(SequentialListPtr paraListPtr)  {
  	printf("The address of the structure: %ld\r\n",paraListPtr);
  	printf("The address of acturalLength: %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 function.
   * @param paraListPtr The pointer to the list. It must be a pointer to change the list.
   * @param paraValues An int array stoting 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
 
 /**
  * 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.
  * @param paraValue 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 <0) {
		printf("Cannot insert element: negative position unsupported.");
		return;
	}//Of if
	if (paraPosition > paraListPtr->actualLength) {
		printf("Cannot insert element: the position %d is bigger than the list length %d.\r\n",paraPosition, paraListPtr->actualLength);
		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 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 last.
	printf("Now insert to the last, 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 change the 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 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 fot 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 = 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 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->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 getElemnt(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 list 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.
 */
 int main() {
 	sequentialInsertTest();
 	sequentialDeleteTest();
 }// Of main

二.运行结果如下

---- sequentialInsertTest begins. ----
After initialization, the list is: 3 5 2 7 4
Now insert to the last, 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: 7017536
The address of acturalLength: 7017536
The address of data: 7017540
The address of actual data:7017540
The address of second data:7017544

--------------------------------
Process exited after 0.4878 seconds with return value 0
请按任意键继续. . .

三.收获

从摘抄代码的过程中我意识到许多问题,看似简单的工作原来稍不谨慎也会漏洞百出,同时也使我明白程序员最需要的品质就是细心和足够的耐心,善于找出自己的错误,并及时正确的修补它。在未来的学习过程中我和也会身体力行去实践它。

  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值