【作业】2.3双向链表

#include <stdio.h>
#include <malloc.h>
typedef struct DoubleLinkedNode{
	char data;
	//char date 
	struct DoubleLinkedNode *previous;
	//struct DoubleLinkedNode *Previous:
	struct DoubleLinkedNode *next;
} DLNode, *DLNodePtr;
/*
DLNodePtr initLinkList(){
	DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	tempHeader->data = '\0';
	tempHeader->previous = NULL;
	tempHeader->next = NULL;
	return tempHeader;
}*/
DLNodePtr initLinkList(){
	DLNodePtr tempHeader = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	tempHeader->data = '\0';
	tempHeader->next = NULL;
	tempHeader->previous = NULL;
	return tempHeader;
}
//打印列表 
/*
void printList(DLNodePtr paraHeader){
	DLNodePtr p = paraHeader->next;
	while (p != NULL) {
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");
} */
void printList(DLNodePtr paraHeader){
	DLNodePtr p = paraHeader->next;
	while(p != NULL){
		printf("%c", p->data);
		p = p->next;
	}
	printf("\r\n");
}
void insertElement(DLNodePtr paraHeader, char paraChar, int paraPosition){
	DLNodePtr p, q, r;
	p = paraHeader;
	//printf("输入位置为 %d \n",paraPosition);
	for (int i = 0; i < paraPosition; i ++) {
		p = p->next;
		//printf("进行一次改变  "); 
		if (p == NULL) {
			printf("The position %d is beyond the scope of the list.", paraPosition);
			return;
		}
	}/*【0【1【2【3...【n【n+1【n+2【...
	p指向【0；
	循环后 
	 p指向【n;
	 r等于【n->next
	 q->next指向【n+1 
	 q->previous指向【n;
	 p(n)->next指向 q ; 
	【head【1【2【3...【n【new(p)【n+1【n+2【...
	如果存在【n+1（p->next->previous指向q） 
	*/
	q = (DLNodePtr)malloc(sizeof(struct DoubleLinkedNode));
	q->data = paraChar;
	r = p->next;
	q->next = p->next;
	q->previous = p;
	p->next = q;
	if (r != NULL) {
		r->previous = q;
	}
}

void deleteElement(DLNodePtr paraHeader, char paraChar){
	DLNodePtr p, q, r;
	p = paraHeader;
	while ((p->next != NULL) && (p->next->data != paraChar)){
		p = p->next;
	}
	if (p->next == NULL) {
		printf("The char '%c' does not exist.\r\n", paraChar);
		return;
	}
	q = p->next;
	r = q->next;
	p->next = r;
	if (r != NULL) {
		r->previous = p;
	}
	free(q);
	/*
	【0【1【2【3...【n【(n+1) data==paraChar【n+2【n+2【...
	p 指向 n;
	q 指向 paraChar；
	r 指向 n+2; 
	p(n)->next指向 n+2 ;
	如果 n+2存在；
	r(n+2)指向 p(n);
	 
	
	【0【1【2【3...【n【n+2【n+2【...
	*/
}
void insertDeleteTest(){
	DLNodePtr tempList = initLinkList();
	printList(tempList);
	insertElement(tempList, 'H', 0);
	insertElement(tempList, 'e', 1);
	insertElement(tempList, 'l', 2);
	insertElement(tempList, 'l', 3);
	insertElement(tempList, 'o', 4);
	insertElement(tempList, '!', 5);
	printList(tempList);
	deleteElement(tempList, 'e');
	deleteElement(tempList, 'a');
	deleteElement(tempList, 'o');
	printList(tempList);
	insertElement(tempList, 'o', 1);
	printList(tempList);
}

void basicAddressTest(){
	DLNode tempNode1, tempNode2;

	tempNode1.data = 4;
	tempNode1.next = NULL;

	tempNode2.data = 6;
	tempNode2.next = NULL;

	printf("The first node: %d, %d, %d\r\n",
		&tempNode1, &tempNode1.data, &tempNode1.next);
	printf("The second node: %d, %d, %d\r\n",
		&tempNode2, &tempNode2.data, &tempNode2.next);

	tempNode1.next = &tempNode2;
}
int main() {
	insertDeleteTest();
	basicAddressTest();
	return 0;
}

双向链表等于在写单链表同时考虑逆向指针。