2.4 静态链表

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

#define DEFAULT_SIZE 5

typedef struct StaticLinkedNode{
	char data;
	
	int next;
}*NodePtr;

typedef struct StaticLinkedList{
	NodePtr nodes;
	
	int* used;
}*ListPtr;

//用头节点初始化链表

ListPtr	initLinkedList(){
	//初始化空间
	
	ListPtr tempPtr = (ListPtr)malloc(sizeof(struct StaticLinkedList)) ;
	
	tempPtr->nodes = (NodePtr)malloc(sizeof(struct StaticLinkedNode)*DEFAULT_SIZE);
	tempPtr->used = (int*)malloc(sizeof(int)*DEFAULT_SIZE);
	
	tempPtr->nodes[0].data = '\0';
	tempPtr->nodes[0].next = -1;
	
	tempPtr->used[0] = 1;
	int i;
	for(i = 0;i<DEFAULT_SIZE;i++){
		tempPtr->used[i] = 0;
	}
	
	return tempPtr;
} 

//打印链表；

void printList(ListPtr paraListPtr){
	int p = 0;
	while(p != -1){
		printf("%c",paraListPtr->nodes[p].data);
		p = paraListPtr->nodes[p].next; 
	}
	printf("\r\n");
} 

void insertElement(ListPtr paraListPtr,char paraChar, int paraPosition){
	int p,q,i;
	
	p = 0;
	for(i=0; i<paraPosition;i++){
		p = paraListPtr->nodes[p].next;
		if(p == -1){
			printf("The position %d is beyond the scope the list.\r\n",paraPosition);
			return; 
		}
	}
	for(i = 1; i < DEFAULT_SIZE; i++){
		if(paraListPtr->used[i]==0){
			printf("Space at &d allocated.\r\n",i);
			paraListPtr->used[i] = 1;
			q = i;
			break;
		}
	}
	if(i == DEFAULT_SIZE){
		printf("No place");
		return;
	}
	
	paraListPtr->nodes[q].data = paraChar;
	
	printf("linking");
	paraListPtr->nodes[q].next = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = q;
}

void deleteElement(ListPtr paraListPtr, char paraChar){
	int p, q;
	p = 0;
	while ((paraListPtr->nodes[p].next != -1) && (paraListPtr->nodes[paraListPtr->nodes[p].next].data != paraChar)){
		p = paraListPtr->nodes[p].next;
	}

	if (paraListPtr->nodes[p].next == -1) {
		printf("Cannot delete %c\r\n", paraChar);
		return;
	}

	q = paraListPtr->nodes[p].next;
	paraListPtr->nodes[p].next = paraListPtr->nodes[paraListPtr->nodes[p].next].next;
	
	paraListPtr->used[q] = 0;
}

void appendInsertDeleteTest(){
	ListPtr tempList = initLinkedList();
	printList(tempList);

	insertElement(tempList, 'H', 0);
	insertElement(tempList, 'e', 1);
	insertElement(tempList, 'l', 2);
	insertElement(tempList, 'l', 3);
	insertElement(tempList, 'o', 4);
	printList(tempList);

	printf("Deleting 'e'.\r\n");
	deleteElement(tempList, 'e');
	printf("Deleting 'a'.\r\n");
	deleteElement(tempList, 'a');
	printf("Deleting 'o'.\r\n");
	deleteElement(tempList, 'o');
	printList(tempList);

	insertElement(tempList, 'x', 1);
	printList(tempList);
}


void main(){
	appendInsertDeleteTest();
}

运行结果

虽然在学习这方面还没有太大的提升，但是在敲了几次代码之后，很明显敲代码的连贯性，以及规范性都有了一定的提升。其次从最开始对链表的完全不懂，已经开始有了一点点起色，不至于什么都完全看不明白。突然发现我的运行结果好像有一点点错误，应该是在那个位置少了\r\n,不过现在也不好再去改了，下来再去改了在对一下运行结果。再者，虽然但是，好像还是没怎么搞懂结构体这个东西，感觉变化的有点多，有多个名称，又一直换来换去，还得专门区学一下，走捷径不学确实是行不通的。