数据结构第一天——线性表

创建线性表

 

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

输出线性表

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

输出地址

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

线性表初始化

SequentialListPtr sequentialListInit(int paraData[], int paraLength) {
	SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));
	int i;
	for (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.\n");
		return;
	}
	
	if (paraPosition < 0) {
		printf("Cannot insert element: negative position unsupported.\n");
		return;
	}
	
	if (paraPosition > paraListPtr->actuallength) {
		printf("Cannot insert element: the position %d is bigger than the list length %d.\n", paraPosition, paraValue);
		return;
	}
	
	int i;
	for (i = paraListPtr->actuallength; i > paraPosition; i --) {
		paraListPtr->data[i] = paraListPtr->data[i - 1];
	}
	
	paraListPtr->data[paraPosition] = paraValue;
	
	paraListPtr->actuallength ++;
}

删除

void sequentialListDelete(SequentialListPtr paraListPtr, int paraPosition) {
	if (paraPosition < 0) {
		printf("Invalid position: %d.\n", paraPosition);
		return;
	}
	
	if (paraPosition >= paraListPtr->actuallength) {
		printf("Cannot delete element: the position %d is beyond the list length %d.\n", paraPosition, paraListPtr->actuallength);
		return;
	}
	
	int i;
	for (i = paraPosition; i < paraListPtr->actuallength; i ++) {
		paraListPtr->data[i] = paraListPtr->data[i + 1];
	}
	
	paraListPtr->actuallength --;
}

第一部分总代码

#include<stdio.h>
#include<stdlib.h>

#define LIST_MAX_LENGTH 10

/**
 *整数线性表，关键是数据
 */

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

/**
 *输出列表
 */

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

/**
 *输出列表的地址
 */

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

/**
 *列表初始化
 */
 
SequentialListPtr sequentialListInit(int paraData[], int paraLength) {
	SequentialListPtr resultPtr = (SequentialListPtr)malloc(sizeof(struct SequentialList));
	int i;
	for (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.\n");
		return;
	}
	
	if (paraPosition < 0) {
		printf("Cannot insert element: negative position unsupported.\n");
		return;
	}
	
	if (paraPosition > paraListPtr->actuallength) {
		printf("Cannot insert element: the position %d is bigger than the list length %d.\n", paraPosition, paraValue);
		return;
	}
	
	int i;
	for (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. ----\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 beyond the tail. \n");
	sequentialListInsert(tempList, 8, 9);
	printf("The list is:");
	outputList(tempList);
	
	for (i = 0; i < 5; i ++) {
		printf("Inserting %d.\n", (i + 10));
		sequentialListInsert(tempList, 0, (i + 10));
		outputList(tempList);
	}
	
	printf("---- sequentialInsertTest ends. ----\n");
}

/**
 *从顺序表中删除元素
 */
 
void sequentialListDelete(SequentialListPtr paraListPtr, int paraPosition) {
	if (paraPosition < 0) {
		printf("Invalid position: %d.\n", paraPosition);
		return;
	}
	
	if (paraPosition >= paraListPtr->actuallength) {
		printf("Cannot delete element: the position %d is beyond the list length %d.\n", paraPosition, paraListPtr->actuallength);
		return;
	}
	
	int i;
	for (i = paraPosition; i < paraListPtr->actuallength; i ++) {
		paraListPtr->data[i] = paraListPtr->data[i + 1];
	}
	
	paraListPtr->actuallength --;
}

/**
 *测试删除功能
 */
 
void sequentialDeleteTest() {
	int tempArray[5] = {3, 5, 2, 7, 4};
	
	printf("---- sequentialDeleteTest begins. ----\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. ----\n");
	
	outputMemory(tempList);
}

int main() {
	sequentialInsertTest();
	sequentialDeleteTest();
	
	return 0;
}

运行结果

查找（某个位置的元素，某个元素所在位置）

int locateElement(SequentialListPtr paraListPtr, int paraValue) {
	int i; 
	for (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 delete 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;
}

获取前驱元素

int NextElement(SequentialListPtr paraListPtr, int paraValue) {
	int i;
    for (i = 0; i < paraListPtr->actuallength; i ++) {
		 if (paraListPtr->data[i] == paraValue&&i<paraListPtr->actuallength-1) {
	         return paraListPtr->data[i+1];
		 }
	}
	return -1;
}